The relative complexity of approximate counting problems (Q1879247)
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 2101908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The relative complexity of approximate counting problems |
scientific article; zbMATH DE number 2101908 |
Statements
The relative complexity of approximate counting problems (English)
0 references
22 September 2004
0 references
Computational complexity
0 references
0.830613374710083
0 references
0.8172812461853027
0 references
0.8138998746871948
0 references
