On the complexity of ranking
Open Access
- 31 October 1990
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 41 (2) , 251-271
- https://doi.org/10.1016/0022-0000(90)90038-m
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Structure of complexity classes: Separations, collapses, and completenessPublished by Springer Nature ,2005
- Computing the counting function of context-free languagesPublished by Springer Nature ,2005
- On sparse oracles separating feasible complexity classesInformation Processing Letters, 1988
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- Computation times of NP sets of different densitiesTheoretical Computer Science, 1984
- Some consequences of non-uniform conditions on uniform classesTheoretical Computer Science, 1983
- On relativization and the existence of complete setsPublished by Springer Nature ,1982
- The complexity of computing the permanentTheoretical Computer Science, 1979
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972