Some Results on Random Unsatisfiable K-sat instances and approximation algorithms applied to random structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2420, Issue , 2002, Pages 280-291

  Goerdt, Andreas ^a   Jurdziński, Tomasz ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HIGH PROBABILITY; LITERALS; RANDOM K-SAT; RANDOM STRUCTURES; SAT INSTANCES; SATISFIABILITY PROBLEMS; SATISFYING ASSIGNMENTS;

APPROXIMATION ALGORITHMS;

EID: 23044533927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_23     Document Type: Conference Paper

References (17)

1. Noga Alon, Joel Spencer. The Probabilistic Method. John Wiley and Sons 1992.
2. D. Achlioptas, A. Chtcherba, G. Istrate, C. Moore, The Phase Transition in NAESAT and 1-in-k SAT. In Proceedings SODA 2001, SIAM, 721-722.
3. E. Ben-Sasson, Y. Bilu, A Gap in Average Proof Complexity, Electronic Colloquium on Computational Complexity (ECCC),003, 2002.
4. P. Berman, M. Karpinski, Approximating Minimum Unsatisfiability of Linear Equations, Electronic Colloquium on Computational Complexity, 025, 2001.
5. M. Bolla. Spectra, Euclidean representations and clusterings of hypergraphs, Discrete Mathematics 117, 1993, 19-39.
6. Fan R. K. Chung. The Laplacian of a Hypergraph. In Expanding Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 10, 1993, American Mathematical society, 21-36.
7. Fan R. K. Chung. Spectral Graph Theory. Conference Board of the Mathematical Sciences,Regional Conferencec Series in Mathematics 92, America Mathematical Society, 1997.
8. U. Feige, Relations between Average Case Complexity and Approximation Complexity, In Proceedings STOC 2002, ACM, to appear.
9. J. Friedman, A. Goerdt, Recognizing more unsatisfiable random 3SAT instances, Proc. of ICALP 2001, LNCS2076, 310-321.
10. J. Friedman, A. Wigderson, On the second Eigenvalue of hypergraphs, Combinatorica 15, 1995, 43-65.
11. A. M. Frieze, M. Jerrum, Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION, Algorithmica 18(1), 1997, 67-81.
12. A. Goerdt, M. Krivelevich. Efficient recognition of unsatisfiable random k-SAT instances by spectral methods, Proc. of STACS2001, LNCS2010, 294-304.
13. J. Hastad. Some optimal inapproximability results. Journal of the ACM, 48(4), 2001, 798-859.
14. V. Kann, J. Lagergren, A. Panconesi, Approximability of maximum splitting of k-Sets and some other Apx-complete problems, IPL 58(3), 1996, 105-110.
15. M. Krivelevich, Deciding k-colorability in expected polynomial time, Information Processing Letters, 81(1), 2002, 1-6.
16. S. Mahajan, H. Ramesh, Derandomizing Approximation Algorithms Based on Semidefinite Programming, SIAM J. Comput. 28(5), 1999, 1641-1663.
17. Gilbert Strang. Linear Algebra and its Applications. Harcourt Brace Jovanovich Publishers, San Diego 1988.