A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992)
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 new upper bound for Max-2-SAT: A graph-theoretic approach |
scientific article; zbMATH DE number 5839383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new upper bound for Max-2-SAT: A graph-theoretic approach |
scientific article; zbMATH DE number 5839383 |
Statements
A new upper bound for Max-2-SAT: A graph-theoretic approach (English)
0 references
20 January 2011
0 references
maximum 2-satisfiability problem
0 references
moderately exponential-time algorithms
0 references
measure and conquer
0 references
1.0000001
0 references
0.94179994
0 references
0.92706937
0 references
0.92481494
0 references
0.9226077
0 references
0 references
0.91880715
0 references
