Author:
Arvind V.,Kurur Piyush P.
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference35 articles.
1. Solvable black-box group problems are low for PP;Arvind;Theoretical Computer Science,1997
2. L. Babai, Trading group theory for randomness, in: 17th Annual Symposium on Foundations of Computer Science, ACM, 1985, pp. 421–429.
3. Bounded round interactive proofs in finite groups;Babai;SIAM Journal of Discrete Mathematics,1992
4. L. Babai, E.M. Luks, Canonical labeling of graphs, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, 1983, pp. 171–183.
5. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes;Babai;Journal of Computer and System Sciences,1988
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献