Author:
Babai L�szl�,Fortnow Lance
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference30 articles.
1. L. Babai, Trading group theory for randomness, inProc. 17th Ann. ACM Symp. Theory of Computing, 1985, 421?429.
2. L. Babai, E-mail and the unexpected power of interaction, inProc. 5th Ann. IEEE Structures in Complexity Theory Conf., 1990, 30?44.
3. L. Babai and L. Fortnow, A characterization of #P by arithmetic straight line programs, inProc. 31st Ann. IEEE Symp. Foundations of Comp. Sci., 1990, 26?34.
4. L. Babai, L. Fortnow, andC. Lund, Nondeterministic exponential time has two-prover interactive protocols,Computational Complexity 1 (1991), 3?40. Extended Abstract inProc. 31st Ann. IEEE Symp. Foundations of Comp. Sci., 1990, 16?25.
5. L. Babai andS. Moran, Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes,Journal Comp. Sys. Sci. 36 (1988), 254?276.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献