Author:
Arvind V.,Vinodchandran N.V.
Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. Bounded round interactive proofs in finite groups;Babai;SIAM J. Discrete Math.,1992
2. Trading group theory for randomness;Babai,1985
3. Fast Monte Carlo algorithms for permutation groups;Babai;J. Comput. System Sci.,1995
4. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes;Babai;J. Comput. System Sci.,1988
5. Fast management of permutation groups;Babai,1988
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Hidden Subgroup Problem and MKTP;Theoretical Computer Science;2019-11
2. Quantum Algorithms for a Set of Group Theoretic Problems;International Journal of Foundations of Computer Science;2015-02
3. Quantum Property Testing of Group Solvability;Algorithmica;2009-07-11
4. Quantum Property Testing of Group Solvability;Lecture Notes in Computer Science;2008
5. LWPP and WPP are not uniformly gap-definable;Journal of Computer and System Sciences;2006-06