Category and Measure in Complexity Classes
- 1 December 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (6) , 1100-1131
- https://doi.org/10.1137/0219076
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Complete sets and closeness to complexity classesTheory of Computing Systems, 1986
- Some Observations about the Randomness of Hard ProblemsSIAM Journal on Computing, 1986
- Sparse Sets, Lowness and HighnessSIAM Journal on Computing, 1986
- Resource-bounded Kolmogorov complexity of hard languagesPublished by Springer Nature ,1986
- Computation times of NP sets of different densitiesTheoretical Computer Science, 1984
- A low and a high hierarchy within NPJournal of Computer and System Sciences, 1983
- Circuit-size lower bounds and non-reducibility to sparse setsInformation and Control, 1982
- The ‘almost all’ theory of subrecursive degrees is decidablePublished by Springer Nature ,1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Measure TheoryPublished by Springer Nature ,1950