Author:
Arvind Vikraman,Köbler Johannes
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Lect Notes Comput Sci;V. Arvind,1997
2. V. Arvind and J. Köbler. Graph isomorphism is low for ZPP(NP) and other lowness results. Technical Report TR99-033, Electronic Colloquium on Computational Complexity, 1999.
3. V. Arvind, J. Köbler, and R. Schuler. On helping and interactive proof systems. International Journal of Foundations of Computer Science, 6(2):137–153, 1995.
4. L. Babai. Bounded round interactive proofs infinite groups. SIAM Journal of Discrete Mathematics, 5:88–111, 1992.
5. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307–318, 1993.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Quantum Algorithm for the Sub-graph Isomorphism Problem;ACM Transactions on Quantum Computing;2023-02-24
2. No Easy Puzzles: A Hardness Result for Jigsaw Puzzles;Lecture Notes in Computer Science;2014
3. S2p⊆ZPPNP;Journal of Computer and System Sciences;2007-02
4. ON HIGHER ARTHUR-MERLIN CLASSES;International Journal of Foundations of Computer Science;2004-02
5. On Higher Arthur-Merlin Classes;Lecture Notes in Computer Science;2002