Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. In: IEEE Foundations of Computer Science, pp. 743–750 (2002)
2. Arvind, V., Torán, J.: Solvable group isomorphism is (almost) in $\mbox {\rm NP}\cap \mbox {\rm co-NP}$ . In: IEEE Conference on Computational Complexity, pp. 91–103 (2004)
3. Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite groups. In: STOC 1991, pp. 164–174
4. Babai, L.: Bounded round interactive proofs in finite groups. SIAM J. Discret. Math. 5(1), 88–111 (1992)
5. Babai, L., Szemerédi, E.: On the complexity of matrix group problems I. In: IEEE Foundations of Computer Science, pp. 229–240 (1984)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Hidden Subgroup Problem and MKTP;Theoretical Computer Science;2019-11
2. Zero knowledge and circuit minimization;Information and Computation;2017-10
3. Zero Knowledge and Circuit Minimization;Mathematical Foundations of Computer Science 2014;2014