Abstract
It is known that random k-Sat instances with at least cn random clauses where c = c k is a suitable constant are unsatisfiable with high probability. These results are obtained by estimating the expected number of satisfying assignments and thus do not provide us with an efficient algorithm. Concerning efficient algorithms it is only known that formulas with n ε · nk/2 clauses with k literals over n underlying variables can be efficiently certified as unsatisfiable. The present paper is the result of trying to lower the preceding bound. We obtain better bounds for some specialized satisfiability problems.
Supported by DFG, grant GO 493/1-1. On leave from Wrocklaw University, Institute of Computer Science, Wrocklaw, Poland.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Noga Alon, Joel Spencer. The Probabilistic Method. John Wiley and Sons 1992.
D. Achlioptas, A. Chtcherba, G. Istrate, C. Moore, The Phase Transition in NAE-SAT and 1-in-k SAT. In Proceedings SODA 2001, SIAM, 721–722.
E. Ben-Sasson, Y. Bilu, A Gap in Average Proof Complexity, Electronic Colloquium on Computational Complexity (ECCC),003, 2002.
P. Berman, M. Karpinski, Approximating Minimum Unsatisfiability of Linear Equations, Electronic Colloquium on Computational Complexity, 025, 2001.
M. Bolla. Spectra, Euclidean representations and clusterings of hypergraphs, Discrete Mathematics 117, 1993, 19–39.
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.
Fan R. K. Chung. Spectral Graph Theory. Conference Board of the Mathematical Sciences,Regional Conferencec Series in Mathematics 92, America Mathematical Society, 1997.
U. Feige, Relations between Average Case Complexity and Approximation Complexity, In Proceedings STOC 2002, ACM, to appear.
J. Friedman, A. Goerdt, Recognizing more unsatisfiable random 3SAT instances, Proc. of ICALP 2001, LNCS 2076, 310–321.
J. Friedman, A. Wigderson, On the second Eigenvalue of hypergraphs, Combinatorica 15, 1995, 43–65.
A. M. Frieze, M. Jerrum, Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION, Algorithmica 18(1), 1997, 67–81.
A. Goerdt, M. Krivelevich. Efficient recognition of unsatisfiable random k-SAT instances by spectral methods, Proc. of STACS 2001, LNCS 2010, 294–304.
J. Hastad. Some optimal inapproximability results. Journal of the ACM, 48(4), 2001, 798–859.
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.
M. Krivelevich, Deciding k-color ability in expected polynomial time, Information Processing Letters, 81(1), 2002, 1–6.
S. Mahajan, H. Ramesh, Derandomizing Approximation Algorithms Based on Semidefinite Programming, SIAM J. Comput. 28(5), 1999, 1641–1663.
Gilbert Strang. Linear Algebra and its Applications. Harcourt Brace Jovanovich Publishers, San Diego 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goerdt, A., Jurdziński, T. (2002). Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_23
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive