Generalized counting constraint satisfaction problems with determinantal circuits (Q472444)
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: Generalized counting constraint satisfaction problems with determinantal circuits |
scientific article; zbMATH DE number 6371082
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized counting constraint satisfaction problems with determinantal circuits |
scientific article; zbMATH DE number 6371082 |
Statements
Generalized counting constraint satisfaction problems with determinantal circuits (English)
0 references
19 November 2014
0 references
counting complexity
0 references
tensor network
0 references
monoidal categories
0 references
0.7746508717536926
0 references
0.752577006816864
0 references
0.7501482963562012
0 references
0.7456847429275513
0 references
0.7314262986183167
0 references
