Uriel Feige
ABSTRACT
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.
- M. Ajtai. "Generating hard instances of lattice problems". In Proceedengs of 28th STOC, 1996, 99--108.]] Google Scholar
Digital Library
- N. Alon, U. Feige, A. Widgerson, D. Zuckerman. "Derandomized graph products". Computational Complexity 5 (1995) 60--75.]] Google ScholarDigital Library
- Paul Beame, Richard Karp, Toni Pitassi, Mike Saks. "On the complexity of unsatisfiability proofs for random k-CNF formulas". In Proc. 30th STOC, 1998, 561--571.]] Google ScholarDigital Library
- Eli Ben-Sasson, Avi Wigderson. "Short proofs are narrow -- resolution made simple". In Proc. 31st STOC, 1999, 517--526.]] Google ScholarDigital Library
- V. Chvatal, E. Szemeredi. "Many hard examples for resolution". JACM, 35(4), 1988, 759--768.]] Google ScholarDigital Library
- Y. Dodis, V. Guruswami, S. Khanna. "The 2-catalog segmentation problem". In Proc. of SODA 1999, 897--898.]] Google ScholarDigital Library
- Uriel Feige, Guy Kortsarz, and David Peleg. "The dense $k$-subgraph problem". Algorithmica (2001) 29: 410--421.]]Google Scholar
- U. Feige and R. Krauthgamer. "A polylogarithmic approximation of the minimum bisection". Proc. of 41st FOCS 2000, 105--115.]] Google ScholarDigital Library
- Uriel Feige and Michael Langberg. "Approximation algorithms for maximization problems arising in graph partitioning". Journal of Algorithms 41, 174--211 (2001).]] Google ScholarDigital Library
- Ehud Friedgut. "Necessary and sufficient conditions for sharp thresholds of graph properties and the k-SAT problem". Journal of the American (MATH)ematical Society 12, 1999, 1017--1054.]]Google ScholarCross Ref
- Joel Friedman, Andreas Geordt. "Recognizing more unsatisfiable random 3SAT instances efficiently". In Proc. 28th ICALP, 2001, 310--321.]] Google ScholarDigital Library
- Andreas Geordt, Michael Krivelevich. "Efficient recognition of unsatisfiable random k-SAT instances by spectral methods". In Proc. of STACS 2001, 294--304.]] Google ScholarDigital Library
- M. Goemans and D. Williamson. "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming". JACM 42:1115--1145, 1995.]] Google ScholarDigital Library
- Johan Hastad. "Some optimal inapproximability results". Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, Texas, 1997, 1--10.]] Google ScholarDigital Library
- H. Karloff, U. Zwick. "A 7/8-approximation algorithm for MAX 3SAT?" In Proc. 38th FOCS, 1997, 406--415.]] Google ScholarDigital Library
- J. Kleinberg, C. Papadimitriou, P. Raghavan. "Segmentation problems: a micro-economic view of data mining". In Proc. 30th ACM Symposium on Theory of Computing, 473--482, 1998.]] Google ScholarDigital Library
- T. Leighton, S. Rao. "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms". JACM 46(6):787--832, 1999.]] Google ScholarDigital Library
- L. Levin. "Average case complete problems". SICOMP 15, 1986, 285--286.]] Google ScholarDigital Library
- M. Mitzenmacher. "On the hardness of finding multiple preset dictionaries". In Proceedings of the 2001 Data Compression Conference, 411--418.]] Google ScholarDigital Library
- Alex Samorodnitsky, Luca Trevisan. "A PCP Characterization of NP with Optimal Amortized Query Complexity". Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, Oregon, 2000, 191--199.]] Google ScholarDigital Library
- H. U. Simon. "On approximate solutions for combinatorial optimization problems". SIAM J. Algebraic Discrete Methods, 3:294--310, 1990.]]Google ScholarDigital Library
- "Phase Transitions in Combinatorial Problems." Theoretical Computer Science, Volume 265, Numbers 1-2. Guest Editors: O. Dubios, R. Monasson, B. Selma, R. Zecchina. Elsevier.]]Google Scholar
- Uri Zwick. "Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint". In Proc 9th SODA, 1998, 201--210.]] Google ScholarDigital Library
- Uri Zwick. "Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems". In Proc. 31st STOC, 1999, 679--687.]] Google ScholarDigital Library
Index Terms
- Relations between average case complexity and approximation complexity
Recommendations
Relations between Average-Case and Worst-Case Complexity
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 analogous average-case assumption “NP is easy on average.” In this paper we establish several new results on the worst-...
Comments