One more occurrence of variables makes satisfiability jump from trivial to NP-complete

Jan Kratochvil, Petr Savicky, Z. Tuza

Research output: Contribution to journalArticle

44 Citations (Scopus)

Abstract

A Boolean formula in a conjunctive normal form is called a (k, s) - formula if every clause contains exactly k variables and every variable occurs in at most s clauses. The (k,s) -- SAT problem is the SATISFIABILITY problem restricted to (k,s) -- formulas. It is proved that for every k ≥ 3 there is an integer f(k) such that (k, s) -- SAT is trivial for s ≤ f(k) (because every (k, s) -- formula is satisfiable) and is NP-complete for s ≥ f(k) + 1. Moreover, f(k) grows exponentially with k, namely, [2k/ck] ≤ f(k) ≤ 2k-1 - 2k-4 - 1 for k ≥ 4.

Original languageEnglish
Pages (from-to)203-210
Number of pages8
JournalSIAM Journal on Computing
Volume22
Issue number1
Publication statusPublished - Feb 1993

Fingerprint

Trivial
Jump
NP-complete problem
Conjunctive Normal Form
Integer

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Theoretical Computer Science

Cite this

One more occurrence of variables makes satisfiability jump from trivial to NP-complete. / Kratochvil, Jan; Savicky, Petr; Tuza, Z.

In: SIAM Journal on Computing, Vol. 22, No. 1, 02.1993, p. 203-210.

Research output: Contribution to journalArticle

@article{ece065f029744c74924e292b669186ad,
title = "One more occurrence of variables makes satisfiability jump from trivial to NP-complete",
abstract = "A Boolean formula in a conjunctive normal form is called a (k, s) - formula if every clause contains exactly k variables and every variable occurs in at most s clauses. The (k,s) -- SAT problem is the SATISFIABILITY problem restricted to (k,s) -- formulas. It is proved that for every k ≥ 3 there is an integer f(k) such that (k, s) -- SAT is trivial for s ≤ f(k) (because every (k, s) -- formula is satisfiable) and is NP-complete for s ≥ f(k) + 1. Moreover, f(k) grows exponentially with k, namely, [2k/ck] ≤ f(k) ≤ 2k-1 - 2k-4 - 1 for k ≥ 4.",
author = "Jan Kratochvil and Petr Savicky and Z. Tuza",
year = "1993",
month = "2",
language = "English",
volume = "22",
pages = "203--210",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",

}

TY - JOUR

T1 - One more occurrence of variables makes satisfiability jump from trivial to NP-complete

AU - Kratochvil, Jan

AU - Savicky, Petr

AU - Tuza, Z.

PY - 1993/2

Y1 - 1993/2

N2 - A Boolean formula in a conjunctive normal form is called a (k, s) - formula if every clause contains exactly k variables and every variable occurs in at most s clauses. The (k,s) -- SAT problem is the SATISFIABILITY problem restricted to (k,s) -- formulas. It is proved that for every k ≥ 3 there is an integer f(k) such that (k, s) -- SAT is trivial for s ≤ f(k) (because every (k, s) -- formula is satisfiable) and is NP-complete for s ≥ f(k) + 1. Moreover, f(k) grows exponentially with k, namely, [2k/ck] ≤ f(k) ≤ 2k-1 - 2k-4 - 1 for k ≥ 4.

AB - A Boolean formula in a conjunctive normal form is called a (k, s) - formula if every clause contains exactly k variables and every variable occurs in at most s clauses. The (k,s) -- SAT problem is the SATISFIABILITY problem restricted to (k,s) -- formulas. It is proved that for every k ≥ 3 there is an integer f(k) such that (k, s) -- SAT is trivial for s ≤ f(k) (because every (k, s) -- formula is satisfiable) and is NP-complete for s ≥ f(k) + 1. Moreover, f(k) grows exponentially with k, namely, [2k/ck] ≤ f(k) ≤ 2k-1 - 2k-4 - 1 for k ≥ 4.

UR - http://www.scopus.com/inward/record.url?scp=0027542444&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027542444&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0027542444

VL - 22

SP - 203

EP - 210

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 1

ER -