RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 2002 Volume 293, Pages 118–128 (Mi znsl1678)

This article is cited in 8 papers

An upper bound $O(2^{0.16254n})$ for Exact 3-Satisfiability: a simpler proof

A. S. Kulikov

Saint-Petersburg State University

Abstract: The exact $3$-satisfiability problem (X3SAT) is: given a Boolean formula in 3-CNF, find a truth assignment, such that exactly one literal in each clause is set to true. It is well-known that X3SAT is NP-complete. In this paper, we present an exact algorithm solving X3SAT in time $O(2^{0.162536n})$, where $n$ is the number of variables. Our proof of this bound is slightly simpler than one of Porschen, Randerath, and Speckenmeyer. These proofs are independent (and algorithms are slightly different), though they are based on the same ideas appeared in the proof of the previous bound $O(2^{0.186916n})$ by the same authors.

UDC: 510.52

Received: 15.12.2002


 English version:
Journal of Mathematical Sciences (New York), 2005, 126:3, 1195–1199

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025