New exact algorithms for the 2-constraint satisfaction problem (Q2437759)
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: New exact algorithms for the 2-constraint satisfaction problem |
scientific article; zbMATH DE number 6269530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New exact algorithms for the 2-constraint satisfaction problem |
scientific article; zbMATH DE number 6269530 |
Statements
New exact algorithms for the 2-constraint satisfaction problem (English)
0 references
13 March 2014
0 references
exact exponential time algorithms
0 references
constraint satisfaction
0 references
maximum satisfiability
0 references
0 references
0.9018937945365906
0 references
0.8629461526870728
0 references
0.8575646281242371
0 references
0.8555156588554382
0 references
0.8512541651725769
0 references
