( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L.

, , и . Inf. Comput., 80 (3): 269-287 (марта 1989)

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.

Klaus-Jörn Lange

Jörn Lange

Jörn Lange

Jörn Lange

Jörn Lange

 

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

Nondeterministic Logspace Reductions.. MFCS, том 176 из Lecture Notes in Computer Science, стр. 378-388. Springer, (1984)An Unambiguous Class Possessing a Complete Set.. STACS, том 1200 из Lecture Notes in Computer Science, стр. 339-350. Springer, (1997)Context-Free Controlled ETOL Systems.. ICALP, том 154 из Lecture Notes in Computer Science, стр. 723-733. Springer, (1983)Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n)., и . Inf. Process. Lett., 25 (1): 13-15 (1987)Complexity Theory and Formal Languages.. IMYCS, том 381 из Lecture Notes in Computer Science, стр. 19-36. Springer, (1988)A Note on the P-completeness of Deterministic One-way Stack Language.. J. Univers. Comput. Sci., 16 (5): 795-799 (2010)StUSPACE(log n) <= DSPACE(log²n / log log n)., и . ISAAC, том 1178 из Lecture Notes in Computer Science, стр. 193-202. Springer, (1996)Are There Formal Languages Complete for SymSPACE(log n)?. Foundations of Computer Science: Potential - Theory - Cognition, том 1337 из Lecture Notes in Computer Science, стр. 125-134. Springer, (1997)Computational Calculus and Hardest Languages of Automata with Abstract Storages., и . FCT, том 529 из Lecture Notes in Computer Science, стр. 200-209. Springer, (1991)Complexity and Structure in Formal Language Theory.. Fundam. Informaticae, 25 (3): 327-352 (1996)