Author:
Lokam Satyanarayana V.,Mahajan Meena,Vinay V.
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. L. Babai. Trading group theory for randomness. In Proc. 17th STOC, pp 421–429, 1985.
2. L. Babai and K. Friedl. On slightly superlinear transparent proofs. Technical Report CS-93-13, Department of Computer Science, University of Chicago, 1993.
3. L. Babai, L. Fortnow, L.A. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proc. 23rd STOC, pp 21–31, 1991.
4. L. Babai and S. Moran. Arthur-Merlin games: a randomized proof system and a hierarchy of complexity classes. J. Comp. Syst. Sci., 36:254–276, 1988.
5. A. Condon and R. Ladner. Probabilistic game automata. J. Comp. Syst. Sci., 36(3):452–489, 1988.