A Computational Proof of Complexity of Some Restricted Counting Problems (Q3630198): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:18, 5 February 2024
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
3 June 2009
0 references
