Author:
Arvind Vikraman,Köbler Johannes,Schöning Uwe,Schuler Rainer
Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. BPP has subexponential time simulations unless EXPTIME has publishable proofs;Babai,1991
2. Arthur-Merlin games: a randomized proof system and a hierarchy of complexity classes;Babai;J. Comput. System Sci.,1988
3. Structural Complexity Theory I + II;Balcázar,1988
4. Introduction to the Theory of Complexity;Bovet,1993
5. On relativized exponential and probabilistic complexity classes;Heller;Inform. and Control,1986
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Untold Story of $$\mathsf {SBP}$$;Computer Science – Theory and Applications;2020
2. Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems;LEIBNIZ INT PR INFOR;2019
3. Proving Circuit Lower Bounds in High Uniform Classes;Interdisciplinary Information Sciences;2014
4. Arthur and Merlin as Oracles;computational complexity;2011-08-05
5. Fixed-Polynomial Size Circuit Bounds;2009 24th Annual IEEE Conference on Computational Complexity;2009-07