Advertisement

A New Lower Bound of Critical Function for (k,s)-SAT

  • Ping Gong
  • Daoyun Xu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)

Abstract

(k,s)–SAT is the propositional satisfiable problem restricted to the instance where each clause has exactly k distinct literals and every variable occurs at most s times. It is known that there exits a critical function f such that for sf(k), all (k,s)–SAT instances are satisfiable, but (k,f(k)+1)–SAT is already NP–complete(k≥ 3). It’s open whether f is computable. In this paper, analogous to the randomized algorithm for finding a two-coloring for given uniform k–hypergraph, the similar one for outputting an assignment for a given formula is presented. Based on it and the probabilistic method, we prove, for every integer k≥ 2, each formula F in (k, *)–CNF with less than 0.58 \(\times \sqrt{\frac{k}{{\rm ln} k}}2^k\) clauses is satisfiable. In addition, by the Lovász Local Lemma, we improve the previous result about the lower bound of f(k).

Keywords

Probabilistic Method Random Assignment Critical Function Conjunctive Normal Form Propositional Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tovey, C.A.: A simplified NP-complete satisfiability problem. Discr. Appl. Math. 8(1), 85–89 (1984)CrossRefMathSciNetMATHGoogle Scholar
  2. Dubois, O.: On the r, s-SAT satisfiability problem and a conjecture of Tovey. Discr. Appl. Math. 26(1), 50–60 (1990)CrossRefGoogle Scholar
  3. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Electronic Colloquium on Computational Complexity(ECCC). Technical Report TR03-022 (2003)Google Scholar
  4. Hoory, S., Szeider, S.: Computing unsatisfiable k-SAT instances with few occurrences per variable (2004) (submitted)Google Scholar
  5. Kratochvíl, J., Savický, P., tuza, Z.: One more occurrence of variables make satisfiability jmup from trivial to NP-complete. Acta Informatica 30, 397–403 (1993)CrossRefMathSciNetMATHGoogle Scholar
  6. Savický, P., Sgall, J.: DNF tautologies with a limited number of occurrences of every vairiable. Theoret. Comput. Sci. 238(1-2), 49–495 (2000)Google Scholar
  7. Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Series. John Wiley & Sons. Inc, NewYork (1992)MATHGoogle Scholar
  8. Spencer, J.H.: Ten Lectures on the Probabilistic Method. SIAM, Philadephia (1987); Second edition published in (1994)MATHGoogle Scholar
  9. Mcdiarmid, C.: A random recolouring method for graphs and hypergraphs. Combinatorics, Probability and Computing 2, 363–365 (1973)MathSciNetGoogle Scholar
  10. Mcdiarmid, C.: Hypergraph colouring and the Lovász Local Lemmma. Discrete Mathematics 167/168, 481–486 (1997)CrossRefMathSciNetGoogle Scholar
  11. Beck, J.: On 3-chomatic hypergraphs. Discrete Mathematics 24, 127–137 (1978)CrossRefMathSciNetMATHGoogle Scholar
  12. Radhakrishnan, J., Srinivasan, A.: Improved bounds and algorithms for hypergraph 2-colouring. Rand. Structures and Algorithms 16, 4–32 (2000)CrossRefMathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ping Gong
    • 1
  • Daoyun Xu
    • 2
  1. 1.Department of MathematicsGuizhou UniversityGuiyangP.R. China
  2. 2.Department of Computer ScienceGuizhou UniversityGuiyangP.R. China

Personalised recommendations