The complexity of symmetric Boolean parity Holant problems (Q5891075)
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: The complexity of symmetric Boolean parity Holant problems |
scientific article; zbMATH DE number 6184156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of symmetric Boolean parity Holant problems |
scientific article; zbMATH DE number 6184156 |
Statements
4 July 2013
0 references
complexity
0 references
parity
0 references
dichotomy theorem
0 references
parity Holant problems
0 references
The complexity of symmetric Boolean parity Holant problems (English)
0 references
0.9921413064002992
0 references
0.8573034405708313
0 references
0.8543258309364319
0 references
0.8530949950218201
0 references
0.8445364832878113
0 references
