Relations between average-case and worst-case complexity

Authors:
A. Pavan;N. V. Vinodchandran
Affiliations:
Department of Computer Science, Iowa State University;Department of Computer Science and Engineering, University of Nebraska-Lincoln
Venue:
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Year:
2005

Citing 17
Cited 0

Average case complete problems

SIAM Journal on Computing
Trading group theory for randomness

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
NP is as easy as detecting unique solutions

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Structural complexity 1

Structural complexity 1
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Average case completeness

Journal of Computer and System Sciences
On the hardness of computing the permanent of random matrices (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Highly resilient correctors for polynomials

Information Processing Letters
On the theory of average case complexity

Journal of Computer and System Sciences
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
Average-case computational complexity theory

Complexity theory retrospective II
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses

SIAM Journal on Computing
Some Results on Derandomization

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A personal view of average-case complexity

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Average-case intractability vs. worst-case intractability

Information and Computation
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

The consequences of the worst-case assumption NP = P are very well understood. On the other hand, we only know a few consequences of the average-case assumption “NP is easy on average.” In this paper we establish several new results on the worst-case complexity of Arthur-Merlin games (the class AM) under the average-case complexity assumption “NP is easy on average.”