An approximation trichotomy for Boolean \#CSP (Q972385): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Changed label, description and/or aliases in en, and other parts |
||
| (One intermediate revision by one other user not shown) | |||
| description / en | description / en | ||
scientific article | scientific article; zbMATH DE number 5711904 | ||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcss.2009.08.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2009.08.003 / rank | |||
Normal rank | |||
Latest revision as of 14:19, 11 July 2025
scientific article; zbMATH DE number 5711904
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
