Hitting sets derandomize BPP
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Hitting sets derandomize BPPPublished by Springer Nature ,1996
- Hardness vs randomnessJournal of Computer and System Sciences, 1994
- Complexity of Nondeterministic FunctionsBRICS Report Series, 1994
- Efficient construction of a small hitting set for combinatorial rectangles in high dimensionPublished by Association for Computing Machinery (ACM) ,1993
- On the power of two-point based samplingJournal of Complexity, 1989
- The complexity of symmetric boolean functionsPublished by Springer Nature ,1987
- 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