A computational proof of complexity of some restricted counting problems (Q534558): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C22 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68-04 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5895903 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Holant problem | |||
| Property / zbMATH Keywords: Holant problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
holographic reduction | |||
| Property / zbMATH Keywords: holographic reduction / rank | |||
Normal rank | |||
Revision as of 08:42, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational proof of complexity of some restricted counting problems |
scientific article |
Statements
A computational proof of complexity of some restricted counting problems (English)
0 references
18 May 2011
0 references
Holant problem
0 references
holographic reduction
0 references
