Author of the publication

Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract)

, , and . FOCS, page 449-461. IEEE Computer Society, (1987)

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

Are There Interactive Protocols for CO-NP Languages?, and . Inf. Process. Lett., 28 (5): 249-251 (1988)Halting Space-Bounded Computations.. Theor. Comput. Sci., (1980)Introduction to the theory of computation.. PWS Publishing Company, (1997)A Topological View of Some Problems in Complexity Theory.. MFCS, volume 176 of Lecture Notes in Computer Science, page 567-572. Springer, (1984)Optimal Constructions of Hybrid Algorithms., , , and . J. Algorithms, 29 (1): 142-164 (1998)Parity, Circuits, and the Polynomial-Time Hierarchy, , and . FOCS, page 260-270. IEEE Computer Society, (1981)Optimal Constructions of Hybrid Algorithms, , , and . CoRR, (2001)Compression and Ranking, and . STOC, page 440-448. ACM, (1985)Borel Sets and Circuit Complexity. STOC, page 61-69. ACM, (1983)Monotone Separation of Logspace from NC., and . Computational Complexity Conference, page 294-298. IEEE Computer Society, (1991)