A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.05.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2895952552 / rank | |||
Normal rank | |||
Revision as of 01:52, 20 March 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
