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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 78; no. 1; pp. 305 - 335
Main Authors:	Gaspers, Serge, Sorkin, Gregory B.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 2012
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!