An approximation trichotomy for Boolean \#CSP (Q972385)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5711904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation trichotomy for Boolean \#CSP |
scientific article; zbMATH DE number 5711904 |
Statements
An approximation trichotomy for Boolean \#CSP (English)
0 references
25 May 2010
0 references
approximation algorithms
0 references
combinatorial enumeration
0 references
computational complexity
0 references
constraint satisfaction problems
0 references
0.8762575387954712
0 references
0.874973475933075
0 references
0.8746354579925537
0 references
0.8741575479507446
0 references
