Skip to main content
SpringerLink
Log in

On the lower bounds of random Max 3 and 4-SAT

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

A k-CNF formula is said to be p-satisfiable if there exists a truth assignment satisfying a fraction of \(1-2^{-k}+p2^{-k}\) of its clauses. We obtain better lower bounds for random 3 and 4-SAT to be p-satisfiable. The technique we use is a delicate weighting scheme of the second moment method, where for every clause we give appropriate weight to truth assignments according to their number of satisfied literal occurrences.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Achlioptas D, Moore C (2002) The asymptotic order of the random \(k\)-SAT threshold. In: Proceedings of 43rd annual symposium on foundations of computer science, pp 126–127

  • Achlioptas D, Peres Y (2004) The threshold for random \(k\)-SAT is \(2^k\log 2-O(k)\). J Am Math Soc 17(4):947–973

    Article  MATH  Google Scholar 

  • Achlioptas D, Naor A, Peres Y (2007) On the maximum satisfiability of random formulas. J Assoc Comput Mach 54(2):10

    Article  MathSciNet  MATH  Google Scholar 

  • Borchers B, Furman J (1998) A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. J Comb Optim 2(4):299–306

    Article  MathSciNet  MATH  Google Scholar 

  • Broder AZ, Frieze AM, Upfal E (1993) On the satisfiability and maximum satisfiability of random 3-CNF formulas. In: Proceedings of 4th annual ACM-SIAM symposium on discrete algorithms, pp 322–330

  • Coppersmith D, Gamarnik D, Hajiaghayi MT, Sorkin GB (2003) Random MAX 2-SAT and MAX CUT. In: 14th annual ACM-SIAM symposium on discrete algorithms (Baltimore, MD, 2003). ACM, New York

  • de Bruijn NG (1981) Asymptotic methods in analysis, 3rd edn. Dover Publications Inc., New York

    MATH  Google Scholar 

  • de la Vega WF, Karpinski M (2002) 9/8-approximation algorithm for random MAX 3-SAT. Technical Report TR02-070. Electronic Colloquium on Computational Complexity

  • Goemans M, Williamson D (1994) New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM J Discrete Math 7:656–666

    Article  MathSciNet  MATH  Google Scholar 

  • Håstad J (2001) Some optimal inapproximability results. J ACM 48(4):798–859

    Article  MathSciNet  MATH  Google Scholar 

  • Hirsch EA (2000) A new algorithm for MAX 2-SAT, STACS 2000, LNCS 1770, pp 65–73

  • Kaporis AC, Kirousis LM, Lalas EG (2006) The probabilistic analysis of a greedy satisfiability algorithm. Random Struct Algorithms 28:444–480

    Article  MathSciNet  MATH  Google Scholar 

  • Liu J, Xu K (2016) A novel weighting scheme for random \(k\)-SAT. Sci China Inf Sci 59(9):092101. https://doi.org/10.1007/s11432-016-5526-8

    Article  MathSciNet  Google Scholar 

  • Vorob’ev FYu (2007) A lower bound for the 4-satisfiability threshold. Discrete Math Appl 17(3):287–294

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Beijing Technology and Business University, Beijing, 100048, China

    Guangyan Zhou

  2. School of Mathematics and Systems Science, Beihang University, Beijing, 100191, China

    Zongsheng Gao

Authors
  1. Guangyan Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zongsheng Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guangyan Zhou.

Additional information

Research supported by National Natural Science Fund of China (Grant Nos. 11626039, 61702019), Beijing committee project of talented youth (2016000020124G028).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, G., Gao, Z. On the lower bounds of random Max 3 and 4-SAT. J Comb Optim 35, 1286–1299 (2018). https://doi.org/10.1007/s10878-018-0267-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0267-9

Keywords

Search

Navigation