Skip to main navigation Skip to search Skip to main content

A novel weighting scheme for random k-SAT

  • Jun Liu
  • , Ke Xu*
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Consider a random k-conjunctive normal form Fk(n, rn) with n variables and rn clauses. We prove that if the probability that the formula Fk(n, rn) is satisfiable tends to 0 as n→∞, then r ⩾ 2.83, 8.09, 18.91, 40.81, and 84.87, for k = 3, 4, 5, 6, and 7, respectively.

Original languageEnglish
Article number92101
JournalScience China Information Sciences
Volume59
Issue number9
DOIs
StatePublished - 1 Sep 2016

Keywords

  • complexity
  • phase transition
  • satisfiability
  • second moment method
  • weighting scheme

Fingerprint

Dive into the research topics of 'A novel weighting scheme for random k-SAT'. Together they form a unique fingerprint.

Cite this