On uniform amplification of hardness in NP

Authors:
Luca Trevisan
Affiliations:
U.C. Berkeley
Venue:
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Year:
2005

Citing 14
Cited 13

One-way functions and Pseudorandom generators

Combinatorica - Theory of Computing
On the theory of average case complexity

Journal of Computer and System Sciences
Amplification of weak learning under the uniform distribution

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
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
Pseudorandom generators without the XOR lemma

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Hardness amplification within NP

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hard-core distributions for somewhat hard problems

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A personal view of average-case complexity

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Pseudorandomness and Average-Case Complexity via Uniform Reductions

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
On Worst-Case to Average-Case Reductions for NP Problems

FOCS '03 Proceedings of the 44th Annual 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
On the noise sensitivity of monotone functions

Random Structures & Algorithms
Using nondeterminism to amplify hardness

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Linear-time encodable and decodable error-correcting codes

IEEE Transactions on Information Theory - Part 1

Average-case complexity

Foundations and Trends® in Theoretical Computer Science
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances

Computational Complexity
Uniform direct product theorems: simplified, optimized, and derandomized

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness amplification proofs require majority

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Worst-Case to Average-Case Reductions Revisited

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The uniform hardcore lemma via approximate Bregman projections

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Hardness amplification within NP against deterministic algorithms

Journal of Computer and System Sciences
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized

SIAM Journal on Computing
Hardness Amplification Proofs Require Majority

SIAM Journal on Computing
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Computational randomness from generalized hardcore sets

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
On the complexity of hard-core set constructions

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case.We prove that if every problem in NP admits an efficient uniform algorithm that (averaged over random inputs and over the internal coin tosses of the algorithm) succeeds with probability at least 1 ⁄ 2 +1 (log n )α, then for every problem in NP there is an efficient uniform algorithm that succeeds with probability at least 1 - 1 poly(n). Above, α 0 is an absolute constant.Previously, Trevisan (FOCS'03) presented a similar redution between success 3⁄4 + 1 (log n) and 1 - 1 (log n)α Stronger reductions, due to O'Donnell (STOC'02) and Healy, Vadhan and Viola (FOCS'04) are known in the non-uniform case.