On the complexity of ranking (Q920620)
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: On the complexity of ranking |
scientific article; zbMATH DE number 4164132
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of ranking |
scientific article; zbMATH DE number 4164132 |
Statements
On the complexity of ranking (English)
0 references
1990
0 references
The rank function of a set of strings A is, on input x, the number of elements that are less or equal to x in lexicographic order. The paper analyzes the consequences of certain intractable complexity classes being P-rankable (meaning that the rank function is computable in polynomial time). Questions of this type are connected by logical implications or equivalences to other open problems in complexity theory.
0 references
ranking
0 references
printability
0 references
Kolmogorov complexity
0 references
