Resource bounded randomness and weakly complete problems
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Almost everywhere high nonuniform complexityJournal of Computer and System Sciences, 1992
- Category and Measure in Complexity ClassesSIAM Journal on Computing, 1990
- Diagonalizing over deterministic polynomial timeLecture Notes in Computer Science, 1988
- Diagonalizations over polynomial time computable setsTheoretical Computer Science, 1987
- The density and complexity of polynomial cores for intractable setsInformation and Control, 1986
- Zufälligkeit und WahrscheinlichkeitLecture Notes in Mathematics, 1971
- The definition of random sequencesInformation and Control, 1966