Author of the publication

The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L.

, , and . Inf. Comput., 80 (3): 269-287 (March 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n)., and . Inf. Process. Lett., 25 (1): 13-15 (1987)The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L., , and . Inf. Comput., 80 (3): 269-287 (March 1989)Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata., and . RAIRO Theor. Informatics Appl., 23 (1): 87-99 (1989)Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata., and . STACS, volume 294 of Lecture Notes in Computer Science, page 118-125. Springer, (1988)The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2., , and . ICALP, volume 267 of Lecture Notes in Computer Science, page 531-541. Springer, (1987)A Relation Between Sparse and Printable Sets in NSPACE(log n).. Foundations of Computer Science: Potential - Theory - Cognition, volume 1337 of Lecture Notes in Computer Science, page 177-184. Springer, (1997)