Optimal 2-constraint satisfaction via sum-product algorithms (Q844150)
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: Optimal 2-constraint satisfaction via sum-product algorithms |
scientific article; zbMATH DE number 5659897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal 2-constraint satisfaction via sum-product algorithms |
scientific article; zbMATH DE number 5659897 |
Statements
Optimal 2-constraint satisfaction via sum-product algorithms (English)
0 references
18 January 2010
0 references
algorithms
0 references
computational complexity
0 references
matrix multiplication
0 references
maximum satisfiability
0 references
sum-product
0 references
0.8617306351661682
0 references
0.8576216101646423
0 references
0.8512541651725769
0 references
0.8273838758468628
0 references
0.8243451118469238
0 references
