A Computational Proof of Complexity of Some Restricted Counting Problems (Q3630198): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 13:05, 5 March 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
