Abstract
We consider the regular model of formula generation in conjunctive normal form (CNF) introduced by Boufkhad et. al. in [6]. In [6], it was shown that the threshold for regular random 2-SAT is equal to unity. Also, upper and lower bound on the threshold for regular random 3-SAT were derived. Using the first moment method, we derive an upper bound on the threshold for regular random k-SAT for any k ≥ 3 and show that for large k the threshold is upper bounded by 2k ln (2). We also derive upper bounds on the threshold for Not-All-Equal (NAE) satisfiability for k ≥ 3 and show that for large k, the NAE-satisfiability threshold is upper bounded by 2k − 1 ln (2). For both satisfiability and NAE-satisfiability, the obtained upper bound matches with the corresponding bound for the uniform model of formula generation [9,1].
For the uniform model, in a series of break through papers Achlioptas, Moore, and Peres showed that a careful application of the second moment method yields a significantly better lower bound on threshold as compared to any rigorously proven algorithmic bound [3,1]. The second moment method shows the existence of a satisfying assignment with uniform positive probability (w.u.p.p.). Thanks to the result of Friedgut for uniform model [10], existence of a satisfying assignment w.u.p.p. translates to existence of a satisfying assignment with high probability (w.h.p.). Thus, the second moment method gives a lower bound on the threshold. As there is no known Friedgut type result for regular random model, we assume that for regular random model existence of a satisfying assignments w.u.p.p. translates to existence of a satisfying assignments w.h.p. We derive the second moment of the number of satisfying assignments for regular random k-SAT for k ≥ 3. There are two aspects in deriving the lower bound using the second moment method. The first aspect is given any k, numerically evaluate the lower bound on the threshold. The second aspect is to derive the lower bound as a function of k for large enough k. We address the first aspect and evaluate the lower bound on threshold. The numerical evaluation suggests that as k increases the obtained lower bound on the satisfiability threshold of a regular random formula converges to the lower bound obtained for the uniform model. Similarly, we obtain lower bounds on the NAE-satisfiability threshold of the regular random formulas and observe that the obtained lower bound seems to converge to the corresponding lower bound for the uniform model as k increases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
AChlioptas, D., Moore, C.: Random k-SAT: Two moments suffice to cross a sharp threshold. SIAM J. COMPUT. 36, 740–762 (2006)
Achlioptas, D., Naor, A., Peres, Y.: On the maximum satisfiability of random formulas. Journal of the Association of Computing Machinary (JACM) 54 (2007)
AChlioptas, D., Peres, Y.: The threshold for random k-SAT is 2k ln (2) − O(k). Journal of the American Mathematical Society 17, 947–973 (2004)
Barak, O., Burshtein, D.: Lower bounds on the spectrum and error rate of LDPC code ensembles. In: International Symposium on Information Theory, Adelaide, Australia (2002)
Bender, E.A., Richmond, L.B.: Central and local limit theorems applied to asymptotic enumeration II: Multivariate generating functions. J. Combin. Theory, Ser. A 34, 255–265 (1983)
Boufkhad, Y., Dubois, O., Interian, Y., Selman, B.: Regular random k-SAT: Properties of balanced formulas. Journal of Automated Reasoning (2005)
Bruijn, N.G.D.: Asymptotic Methods in Analysis. North Holland, Amsterdam (1981)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)
Franco, J., Paull, M.: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discrete Appl. Math. 5, 77–87 (1983)
Friedgut, E.: Sharp threshold for graph properties, and the k-SAT problem. Journal of the American Mathematical Society 17, 947–973 (2004)
Gardy, D.: Some results on the asymptotic behavior of coefficients of large powers of functions. Discrete Mathematics 139, 189–217 (1995)
Henrici, P.: Applied and Computation Complex Analysis, vol. 2. John Wiley, Chichester (1974)
Kaporis, A.C., Kirousis, L.M., Lalas, E.G.: The probabilistic analysis of a greedy satisfying algorithm. In: 10th Annual European Symposium on Algorithms, vol. Ser. A 34 (2002)
Rathi, V.: On the asymptotic weight and stopping set distributions of regular LDPC ensembles. IEEE Trans. Inform. Theory 52, 4212–4218 (2006)
Rathi, V.: Non-binary LDPC codes and EXIT like functions, PhD thesis, Swiss Federal Institute of Technology (EPFL), Lausanne (2008)
Rathi, V., Aurell, E., Rasmussen, L., Skoglund, M.: Bounds on maximum satisfiability threshold of regular random k-SAT. arXiv:1004.2425 (submitted)
Rathi, V., Aurell, E., Rasmussen, L., Skoglund, M.: Satisfiability and maximum satisfiability of regular random k-sat: Bounds on thresholds (in preparation for journal submission)
Richardson, T., Urbanke, R.: Modern Coding Theory. Cambridge University Press, Cambridge (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rathi, V., Aurell, E., Rasmussen, L., Skoglund, M. (2010). Bounds on Threshold of Regular Random k-SAT. In: Strichman, O., Szeider, S. (eds) Theory and Applications of Satisfiability Testing – SAT 2010. SAT 2010. Lecture Notes in Computer Science, vol 6175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14186-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-14186-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14185-0
Online ISBN: 978-3-642-14186-7
eBook Packages: Computer ScienceComputer Science (R0)