BPP has subexponential time simulations unlessEXPTIME has publishable proofs
暂无分享,去创建一个
[1] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.
[2] Rafael Hirschfeld,et al. Pseudorandom Generators and Complexity Classes , 1989, Advances in Computational Research.
[3] Hugo Krawczyk,et al. On the existence of pseudorandom generators , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[4] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[5] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1992, JACM.
[6] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.
[7] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..
[8] Leonard M. Adleman,et al. Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[9] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[10] Lance Fortnow,et al. Arithmetization: A new method in structural complexity theory , 2005, computational complexity.
[11] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[12] Manuel Blum,et al. How to Generate Cryptographically Strong Sequences of Pseudo Random Bits , 1982, FOCS.
[13] Noam Nisan,et al. Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[14] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[15] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[16] Dan Suciu,et al. Journal of the ACM , 2006 .
[17] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[18] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[19] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[20] Hans Heller,et al. On Relativized Exponential and Probabilistic Complexity Classes , 1986, Inf. Control..
[21] Johan Håstad,et al. Pseudo-random generators under uniform assumptions , 1990, STOC '90.
[22] Manuel Blum,et al. Designing programs that check their work , 1989, STOC '89.
[23] Neil Immerman,et al. Sparse sets in NP-P: Exptime versus nexptime , 1983, Inf. Control..
[24] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[25] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[26] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[27] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[28] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..
[29] László Babai,et al. Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..
[30] Neil Immerman,et al. Sparse Sets in NP-P: EXPTIME versus NEXPTIME , 1985, Inf. Control..
[31] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[32] Leonid A. Levin,et al. One way functions and pseudorandom generators , 1987, Comb..