From post

Corrigendum: Speed-ups by Changing the Order in which Sets are Enumerated.

. Math. Syst. Theory, 7 (4): 352 (1974)see: Mathematical Systems Theory 5(2): 148-156(1971).

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Reductions Among Polynomial Isomorphism Types., и . Theor. Comput. Sci., (1985)Corrigendum: Speed-ups by Changing the Order in which Sets are Enumerated.. Math. Syst. Theory, 7 (4): 352 (1974)see: Mathematical Systems Theory 5(2): 148-156(1971).In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition., и . Kurt Gödel Colloquium, том 713 из Lecture Notes in Computer Science, стр. 187-189. Springer, (1993)Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract)., , , , и . FCT, том 380 из Lecture Notes in Computer Science, стр. 35-46. Springer, (1989)How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions.. SIGACT News, 23 (3): 107-117 (1992)The 1988 Snowbird Report: A Discipline Matures., , и . Commun. ACM, 32 (3): 294-297, 318 (1989)Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract), и . STOC, стр. 55-61. ACM, (1981)Text File Format Identification: An Application of AI for the Curation of Digital Records., , и . iPRES, (2021)Intelligent Simulation-Based Lot Scheduling of Photolithography Toolsets in a Wafer Fabrication Facility., и . WSC, стр. 1935-1942. IEEE Computer Society, (2004)Generalization of EF-based Assignment Strategies for Cycle Time Optimization at Complex wet Stations., , и . WSC, стр. 3660-3671. IEEE, (2018)