scientific article; zbMATH DE number 7561753
From MaRDI portal
Publication:5092476
Cites work
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- \(\text{RL}\subseteq \text{SC}\)
- A sample of samplers: a computational perspective on sampling
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- scientific article; zbMATH DE number 3723866 (Why is no real title available?)
- scientific article; zbMATH DE number 1097580 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- On recycling the randomness of states in space bounded computation
- Pseudorandom generators for group products, extended abstract
- Pseudorandom generators for space-bounded computation
- Pseudorandom generators for width-3 branching programs
- Pseudorandomness
- Pseudorandomness for network algorithms
- Randomness is linear in space
- Relationships between nondeterministic and deterministic tape complexities
- Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace
- Tiny families of functions with random properties: A quality-size trade-off for hashing
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Cited in
(11)- Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs
- Hitting sets give two-sided derandomization of small space
- Simple optimal hitting sets for small-success RL
- Paradigms for Unconditional Pseudorandom Generators
- Near-optimal derandomization of medium-width branching programs
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs
- \(\mathrm{BPL}\subseteq\mathrm{L}\text{-}\mathrm{AC}^1\)
- Recursive error reduction for regular branching programs
- Pseudodistributions that beat all pseudorandom generators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092476)
