Relations between average case complexity and approximation complexity
U Feige�- Proceedings of the thiry-fourth annual ACM symposium�…, 2002 - dl.acm.org
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002•dl.acm.org
We investigate relations between average case complexity and the complexity of
approximation. Our preliminary findings indicate that this is a research direction that leads to
interesting insights. Under the assumption that refuting 3SAT is hard on average on a
natural distribution, we derive hardness of approximation results for min bisection, dense k-
subgraph, max bipartite clique and the 2-catalog segmentation problem. No NP-hardness of
approximation results are currently known for these problems.
approximation. Our preliminary findings indicate that this is a research direction that leads to
interesting insights. Under the assumption that refuting 3SAT is hard on average on a
natural distribution, we derive hardness of approximation results for min bisection, dense k-
subgraph, max bipartite clique and the 2-catalog segmentation problem. No NP-hardness of
approximation results are currently known for these problems.
We investigate relations between average case complexity and the complexity of approximation. Our preliminary findings indicate that this is a research direction that leads to interesting insights. Under the assumption that refuting 3SAT is hard on average on a natural distribution, we derive hardness of approximation results for min bisection, dense k-subgraph, max bipartite clique and the 2-catalog segmentation problem. No NP-hardness of approximation results are currently known for these problems.
ACM Digital Library