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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 332; H. 1; S. 515 - 541
Hauptverfasser:	Byskov, Jesper Makholm, Madsen, Bolette Ammitzbøll, Skjernaa, Bjarke
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 28.02.2005 Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!