A new general derandomization method
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2102761
- Simplified derandomization of BPP using a hitting set generator
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
- On derandomizing algorithms that err extremely rarely
- scientific article; zbMATH DE number 1559537
Cited in
(19)- Randomness vs time: Derandomization under a uniform assumption
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
- Reconstructive dispersers and hitting set generators
- A Generalization of Peres’s Algorithm for Generating Random Bits From Loaded Dice
- Simplified derandomization of BPP using a hitting set generator
- scientific article; zbMATH DE number 124397 (Why is no real title available?)
- scientific article; zbMATH DE number 1962815 (Why is no real title available?)
- scientific article; zbMATH DE number 1765693 (Why is no real title available?)
- scientific article; zbMATH DE number 2102761 (Why is no real title available?)
- A Fast Derandomization Scheme and Its Applications
- Small-bias is not enough to hit read-once CNF
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Pseudo-random generators for all hardnesses
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Paradigms for Unconditional Pseudorandom Generators
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
- On basing auxiliary-input cryptography on NP-hardness via nonadaptive black-box reductions
- Pseudodistributions that beat all pseudorandom generators
This page was built for publication: A new general derandomization method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3841044)
