BPP has subexponential time simulations unlessEXPTIME has publishable proofs
Authors:
- 1 December 1993
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 3 (4) , 307-318
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Algebraic methods for interactive proof systemsJournal of the ACM, 1992
- IP = PSPACEJournal of the ACM, 1992
- Arithmetization: A new method in structural complexity theorycomputational complexity, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- One way functions and pseudorandom generatorsCombinatorica, 1987
- Sparse sets in NP-P: EXPTIME versus NEXPTIMEInformation and Control, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981