How to construct random strings
From MaRDI portal
Cites work
- A qubit, a coin, and an advice string walk into a relational problem
- An introduction to Kolmogorov complexity and its applications
- Extractors and pseudorandom generators
- Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
- Hardness vs randomness
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- scientific article; zbMATH DE number 7515768 (Why is no real title available?)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation, range avoidance, and bounded arithmetic
- On the range avoidance problem for circuits
- Pseudo-random generators for all hardnesses
- Randomness vs. time: de-randomization under a uniform assumption
- Range avoidance for constant depth circuits: hardness and algorithms
- Range avoidance for low-depth circuits and connections to pseudorandomness
- Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms
- Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost
- Simple extractors for all min-entropies and a new pseudorandom generator
- Strong vs. weak range avoidance and the linear ordering principle
- The Complexity of Complexity
- The hardest explicit construction
- The probabilistic method yields deterministic parallel algorithms
- Total functions in the polynomial hierarchy
This page was built for publication: How to construct random strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296789)
