A Computational Proof of Complexity of Some Restricted Counting Problems (Q3630198): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_17 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2174085268 / rank | |||
Normal rank | |||
Latest revision as of 22:16, 19 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
