Author:
Ben-Or Michael,Goldreich Oded,Goldwasser Shafi,Håstad Johan,Kilian Joe,Micali Silvio,Rogaway Phillip
Reference28 articles.
1. Adleman, L., and M. Huang, “Recognizing Primes in Random Polynomial Time,” Proceedings of the 19th STOC, 1987, pp. 462–469.
2. Babai, L., “Trading Group Theory for Randomness,” Proceedings of the 17th STOC, 1985, pp. 421–429.
3. Barrington, D., “Bounded Width Polynomial Size Branching Programs Recognize Exactly Those Languages in NC
1,” Proceedings of the 18th STOC, 1986, pp. 1–5.
4. Babai, L. and S. Moran, “Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes,” manuscript.
5. Blum, M., “Coin Flipping by Telephone,” IEEE COMPCON, 1982, pp. 133–137.
Cited by
82 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献