Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490)
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: Approximate counting for complex-weighted Boolean constraint satisfaction problems |
scientific article; zbMATH DE number 5851837
- Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate counting for complex-weighted Boolean constraint satisfaction problems |
scientific article; zbMATH DE number 5851837 |
|
Statements
Approximate counting for complex-weighted Boolean constraint satisfaction problems (English)
0 references
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems (English)
0 references
27 November 2012
0 references
15 February 2011
0 references
constraint satisfaction problem
0 references
constraint
0 references
T-constructibility
0 references
Holant problem
0 references
signature
0 references
approximation-preserving reduction
0 references
dichotomy theorem
0 references
0.975597083568573
0 references
0.9011439085006714
0 references
0.8920747637748718
0 references
0.8701265454292297
0 references
