Counting solutions to CSP using generating polynomials (Q2447541)
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: Counting solutions to CSP using generating polynomials |
scientific article; zbMATH DE number 6289279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting solutions to CSP using generating polynomials |
scientific article; zbMATH DE number 6289279 |
Statements
Counting solutions to CSP using generating polynomials (English)
0 references
28 April 2014
0 references
constraint satisfaction problem
0 references
generating functions
0 references
counting problem
0 references
CNF SAT
0 references
treewidth
0 references
0.8165714144706726
0 references
0.800029993057251
0 references
0.792865514755249
0 references
0.7869175672531128
0 references
