A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MAX-2-SAT / rank | |||
Normal rank | |||
Revision as of 12:18, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between |
scientific article |
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
