Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- P = BPP if E requires exponential circuitsPublished by Association for Computing Machinery (ACM) ,1997
- Randomness-optimal sampling, extractors, and constructive leader electionPublished by Association for Computing Machinery (ACM) ,1996
- Hitting sets derandomize BPPPublished by Springer Nature ,1996
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- Ramanujan graphsCombinatorica, 1988
- Deterministic simulation in LOGSPACEPublished by Association for Computing Machinery (ACM) ,1987
- The complexity of symmetric boolean functionsPublished by Springer Nature ,1987
- Eigenvalues and expandersCombinatorica, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982