BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Randomness vs. Time: De-Randomization under a Uniform Assumption
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Pseudorandomness and Average-Case Complexity via Uniform Reductions
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Expander-Based Constructions of Efficiently Decodable Codes
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
List-Decoding Using The XOR Lemma
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Hardness amplification within NP
Journal of Computer and System Sciences - Special issue on computational complexity 2002
On uniform amplification of hardness in NP
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of constructing pseudorandom generators from hard functions
Computational Complexity
On Constructing Parallel Pseudorandom Generators from One-Way Functions
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Using Nondeterminism to Amplify Hardness
SIAM Journal on Computing
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
On Worst-Case to Average-Case Reductions for NP Problems
SIAM Journal on Computing
Uniform direct product theorems: simplified, optimized, and derandomized
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Learning noisy characters, multiplication codes, and cryptographic hardcore predicates
Learning noisy characters, multiplication codes, and cryptographic hardcore predicates
Hardness Amplification via Space-Efficient Direct Products
Computational Complexity
Generalized minimum distance decoding
IEEE Transactions on Information Theory
Linear-time encodable/decodable codes with near-optimal rate
IEEE Transactions on Information Theory
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
IEEE Transactions on Information Theory - Part 2
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
| Hi-index | 0.00 |
We study the average-case hardness of the class NP against algorithms in P. We prove that there exists some constant @m0 such that if there is some language in NP for which no deterministic polynomial time algorithm can decide L correctly on a 1-(logn)^-^@m fraction of inputs of length n, then there is a language L^' in NP for which no deterministic polynomial time algorithm can decide L^' correctly on a 3/4+(logn)^-^@m fraction of inputs of length n. In coding theoretic terms, we give a construction of a monotone code that can be uniquely decoded up to error rate 14 by a deterministic local decoder.