Relations between Average Case Complexity and Approximation Complexity

Authors:
Uriel Feige
Affiliations:
-
Venue:
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Year:
2002

Citing 0
Cited 3

Polynomial flow-cut gaps and hardness of directed cut problems

Journal of the ACM (JACM)
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Statistical algorithms and a lower bound for detecting planted cliques

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate relations between average case complexity and the complexity of approximation. Under the assumption that refuting 3SAT is hard on average on a natural distribution, we derive new hardness of approximation results.