A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between

In this paper we introduce “hybrid” Max 2-CSP formulas consisting of “simple clauses”, namely conjunctions and disjunctions of pairs of variables, and general 2-variable clauses, which can be any integer-valued functions of pairs of boolean variables. This allows an algorithm to use both efficient r...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of computer and system sciences Jg. 78; H. 1; S. 305 - 335
Hauptverfasser:	Gaspers, Serge, Sorkin, Gregory B.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 2012
Schlagworte:	Algorithms Boolean algebra Computational efficiency Constraint satisfaction Convex programming Exponential-time algorithm Hybrid instances Mathematical analysis Mathematical models Measure and conquer Optimization Polynomial space Reduction Running Satisfiability Hybrid instances Exponential-time algorithm Constraint satisfaction Measure and conquer Polynomial space Convex programming Satisfiability
ISSN:	0022-0000, 1090-2724
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!