BPP has subexponential time simulations unlessEXPTIME has publishable proofs
- Lźszló BabaiAffiliated withDepartment of Computer Science, University of Chicago
- , Lance FortnowAffiliated withDepartment of Computer Science, University of Chicago
- , Noam NisanAffiliated withDepartment of Computer Science, Hebrew University
- , Avi WigdersonAffiliated withDepartment of Computer Science, Hebrew University
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
ℴ collapses to the second level of the polynomial-time hierarchy.
ℴ has polynomial-size circuits and
ℴ has publishable proofs (EXPTIME=MA).
We also show thatBPP is contained in subexponential time unless exponential time has publishable proofs for infinitely many input lengths. In addition, we showBPP can be simulated in subexponential time for infinitely many input lengths unless there exist unary languages inMA-P.
The proofs are based on the recent characterization of the power of multiprover interactive protocols and on random self-reducibility via low-degree polynomials. They exhibit an interplay between Boolean circuit simulation, interactive proofs and classical complexity classes. An important feature of this proof is that it does not relativize.
One of the ingredients of our proof is a lemma that states that ifEXPTIME has polynomial size circuits thenEXPTIME=MA. This extends previous work by Albert Meyer.
Key wordsComplexity Classes Interactive Proof Systems
- BPP has subexponential time simulations unlessEXPTIME has publishable proofs
Volume 3, Issue 4 , pp 307-318
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Complexity Classes
- Interactive Proof Systems
- Industry Sectors