No NP problems averaging over ranking of distributions are harder (Q1391309)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: No NP problems averaging over ranking of distributions are harder |
scientific article; zbMATH DE number 1177897
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | No NP problems averaging over ranking of distributions are harder |
scientific article; zbMATH DE number 1177897 |
Statements
No NP problems averaging over ranking of distributions are harder (English)
0 references
22 July 1998
0 references
\(T\) time on average
0 references
average polynomial time
0 references
