A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between |
scientific article; zbMATH DE number 6033497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between |
scientific article; zbMATH DE number 6033497 |
Statements
A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (English)
0 references
11 May 2012
0 references
exponential-time algorithm
0 references
polynomial space
0 references
satisfiability
0 references
constraint satisfaction
0 references
hybrid instances
0 references
measure and conquer
0 references
convex programming
0 references
0 references
0.9999999
0 references
0.9183368
0 references
0.8911797
0 references
0 references
0.8850608
0 references
