On resource-bounded measure and pseudorandomness
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 235-249
- https://doi.org/10.1007/bfb0058034
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Measure on small complexity classes, with applications for BPPPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offsPublished by Springer Nature ,1997
- Hitting sets derandomize BPPPublished by Springer Nature ,1996
- PP Is Closed under Truth-Table ReductionsInformation and Computation, 1996
- The Complexity of Decision Versus SearchSIAM Journal on Computing, 1994
- A Pseudorandom Oracle Characterization of ${\text{BPP}}$SIAM Journal on Computing, 1993
- Almost everywhere high nonuniform complexityJournal of Computer and System Sciences, 1992
- PNP[(log )] and sparse turing-complete sets for NPJournal of Computer and System Sciences, 1989
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- Some connections between nonuniform and uniform complexity classesPublished by Association for Computing Machinery (ACM) ,1980