Abstract
The problem of determining the unsatisfiability threshold for random 3-SAT formulas consists in determining the clause to variable ratio that marks the (experimentally observed) abrupt change from almost surely satisfiable formulas to almost surely unsatisfiable. Up to now, there have been rigorously established increasingly better lower and upper bounds to the actual threshold value. An upper bound of 4.506 was announced by Dubois et al. in 1999 but, to the best of our knowledge, no complete proof has been made available from the authors yet. We consider the problem of bounding the threshold value from above using methods that, we believe, are of interest on their own right. More specifically, we explain how the method of local maximum satisfying truth assignments can be combined withresu lts for coupon collector’s probabilities in order to achieve an upper bound for the unsatisfiability threshold less than 4.571. Thus, we improve over the best, with an available complete proof, previous upper bound, which was 4.596. In order to obtain this value, we also establish a bound on the q-binomial coe.cients (a generalization of the binomial coefficients) which may be of independent interest.
Researchsu pported by EPSRC grant GR/L/77089.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Achlioptas, G. B. Sorkin, “Optimal Myopic Algorithms for Random 3-SAT” in: Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), 2000. pp 590–600.
N. Alon, J. H. Spencer, P. Erdős, The Probabilistic Method, John Wiley and Sons, 1992.
B. Bollobás, Random Graphs, Academic Press, London, 1985.
V. Chvátal, “Almost all graphs with 1.44n edges are 3-colourable,” Random Structures and Algorithms 2, pp 11–28, 1991.
L. Comtet, Advanced Combinatorics; The Art of Finite and Infinite Expansions. D. Reidel, 1974.
R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, D. E. Knuth, “On the Lambert W function,” manuscript, Computer Science Department, University of Waterloo.
O. Dubois, Y. Boufkhad, J. Mandler, “Typical random 3-SAT formulae and the satis.ability threshold,” in: Proc. 11th Symposium on Discrete Algorithms (SODA), pp 126–127, 2000.
C. M. Fortuin, R. W. Kasteleyn, J. Ginibre, Correlation inequalities on some partially ordered sets, Commun. Math. Physics 22, pp. 89–103, 1971.
N. J. Fine, Basic Hypergeometric Series and Applications, Mathematical Surveys and Monographs, Number 27, 1980.
E. Friedgut, appendix by J. Bourgain, “Sharp thresholds of graph properties, and the k-sat problem,” J. Amer. Math. Soc. 12, pp 1017–1054, 1999.
G. Gasper, M. Rahman, Basic Hypergeometric Series, Encyclopedia of Mathematics and its Applications, vol 35, Cambridge University Press, Cambridge, 1990.
S. Janson, Y. C. Stamatiou, M. Vamvakari, “Bounding the unsatis.ability threshold of random 3-SAT,” Random Structures and Algorithms, 17, pp 108–116, 2000.
L.M. Kirousis, Y. C. Stamatiou, An inequality for reducible, increasing properties of randomly generated words, Tech. Rep. TR-96.10.34, C. T. I., University of Patras, Greece, 1996.
L. M. Kirousis, E. Kranakis, D. Krizanc, Y. C. Stamatiou, “Approximating the unsatis.ability threshold of random formulas,” Random Structures and Algorithms 12, pp 253–269, 1998.
D. E. Knuth, Fundamental Algorithms, The Art of Computer Programming, 2nd ed., 1973.
M. B. Monagan, K. O. Geddes, K. M. Heal, G. Labahn, S. M. Vorkoetter, Programming Guide, Maple V Release 5, Springer-Verlag, 1998.
R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
A. M. Odlyzko, “Asymptotic Enumeration Methods,” in: R. L. Graham, M. Grötschel, and L. Lovász, eds. Handbook of Combinatorics, Chapter 22, 1063–1229, Elsevier, 1995.
W. H. Press, S. A. Teukolsky, W. T. Vetterling, B. P. Flannery, Numerical Recipes in C: The Art of Scientific Computing, 2nd ed., Cambridge University Press, 1993.
A. E. Taylor, W.R Mann, Advanced Calculus, 3rd ed., John Wiley & Sons, 1983.
F. J. Wright: http://centaur.maths.qmw.ac.uk/Computer Algebra/. A Maple (V-5) implementation of Downhill Simplex based on code given in [19].
M. Zito, Randomised Techniques in Combinatorial Algorithmics, PhD Thesis, Department of Computer Science, University of Warwick, November 1999.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaporis, A.C., Kirousis, L.M., Stamatiou, Y.C., Vamvakari, M., Zito, M. (2001). Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. In: Theoretical Computer Science. ICTCS 2001. Lecture Notes in Computer Science, vol 2202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45446-2_21
Download citation
DOI: https://doi.org/10.1007/3-540-45446-2_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42672-1
Online ISBN: 978-3-540-45446-5
eBook Packages: Springer Book Archive