On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets
Authors:
- 21 February 2020
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 67-79
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Power from Random StringsSIAM Journal on Computing, 2006
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Natural ProofsJournal of Computer and System Sciences, 1997
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- On the Complexity of Learning Minimum Time-Bounded Turing MachinesSIAM Journal on Computing, 1991
- The Effect of Computerized Tests on the Performance and Attitudes of College StudentsJournal of Educational Computing Research, 1989
- On helping by robust oracle machinesTheoretical Computer Science, 1987
- How to construct random functionsJournal of the ACM, 1986
- Randomness conservation inequalities; information and independence in mathematical theoriesInformation and Control, 1984
- Some consequences of non-uniform conditions on uniform classesTheoretical Computer Science, 1983