A Computational Proof of Complexity of Some Restricted Counting Problems (Q3630198)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5561152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Computational Proof of Complexity of Some Restricted Counting Problems |
scientific article; zbMATH DE number 5561152 |
Statements
A Computational Proof of Complexity of Some Restricted Counting Problems (English)
0 references
3 June 2009
0 references
0.9801530838012696
0 references
0.8578487634658813
0 references
0.8337576389312744
0 references
0.8327950239181519
0 references
0.8161511421203613
0 references
