On Ranking
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
This paper structurally characterizes the complexity of ranking. A set is P-rankable if there is a polynomial time computable function
This paper structurally characterizes the complexity of ranking. A set is P-rankable if there is a polynomial time computable function