Relations between case complexity and approximation complexity

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 534-543

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CRYPTOGRAPHY; GRAPH THEORY; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

APPROXIMATION COMPLEXITY; AVERAGE CASE COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0036038682     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Generating hard instances of lattice problems
2. Derandomized graph products
3. On the complexity of unsatisfiability proofs for random k-CNF formulas
4. Short proofs are narrow - Resolution made simple
5. Many hard examples for resolution
6. The 2-catalog segmentation problem
7. The dense k-subgraph problem
8. A polylogarithmic approximation of the minimum bisection
9. Approximation algorithms for maximization problems arising in graph partitioning
10. Necessary and sufficient conditions for sharp thresholds of graph properties and the k-SAT problem
11. Recognizing more unsatisfiable random 3SAT instances efficiently
12. Efficient recognition of unsatisfiable random k-SAT instances by spectral methods
13. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
14. Some optimal inapproximability results
15. A 7/8-approximation algorithm for MAX 3SAT?
16. Segmentation problems: A micro-economic view of data mining
17. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
18. Average case complete problems
19. On the hardness of finding multiple preset dictionaries
20. A PCP characterization of NP with optimal amortized query complexity
21. On approximate solutions for combinatorial optimization problems
22. Phase transitions in combinatorial problems
23. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
24. Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems