New algorithms for Exact Satisfiability

The Exact Satisfiability problem is to determine if a CNF-formula has a truth assignment satisfying exactly one literal in each clause; Exact 3-Satisfiability is the version in which each clause contains at most three literals. In this paper, we present algorithms for Exact Satisfiability and Exact...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 332; no. 1; pp. 515 - 541
Main Authors:	Byskov, Jesper Makholm, Madsen, Bolette Ammitzbøll, Skjernaa, Bjarke
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 28.02.2005 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Branch-and-reduce algorithm Computer science; control theory; systems Exact 3-Satisfiability Exact Satisfiability Exact sciences and technology Exact solution Exponential-time algorithm Theoretical computing Exponential-time algorithm Exact Satisfiability Branch-and-reduce algorithm Exact 3-Satisfiability Exact solution Assignment Computer theory Satisfiability problem Algorithm Exponential time algorithm
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!