Resource bounded randomness and weakly complete problems
- 1 February 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 172 (1-2) , 195-207
- https://doi.org/10.1016/s0304-3975(95)00260-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Weak completeness in E and E2Theoretical Computer Science, 1995
- The Complexity and Distribution of Hard ProblemsSIAM Journal on Computing, 1995
- Measure, Stochasticity, and the Density of Hard LanguagesSIAM Journal on Computing, 1994
- Almost everywhere high nonuniform complexityJournal of Computer and System Sciences, 1992
- Category and Measure in Complexity ClassesSIAM Journal on Computing, 1990
- Diagonalizations over polynomial time computable setsTheoretical Computer Science, 1987
- The density and complexity of polynomial cores for intractable setsInformation and Control, 1986
- The definition of random sequencesInformation and Control, 1966