The relative complexity of approximate counting problems (Q1879247): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56323980, #quickstatements; #temporary_batch_1711504539957 |
||
| (7 intermediate revisions by 6 users not shown) | |||
| Property / author | |||
| Property / author: Martin Dyer / rank | |||
| Property / author | |||
| Property / author: Mark R. Jerrum / rank | |||
| Property / author | |||
| Property / author: Martin Dyer / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Mark R. Jerrum / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2177243619 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56323980 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:16, 27 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The relative complexity of approximate counting problems |
scientific article |
Statements
The relative complexity of approximate counting problems (English)
0 references
22 September 2004
0 references
Computational complexity
0 references
