scientific article; zbMATH DE number 7561753
From MaRDI portal
Publication:5092476
DOI10.4230/LIPIcs.CCC.2020.25MaRDI QIDQ5092476
Jyun-Jie Liao, Eshan Chattopadhyay
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/2002.07208
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Paradigms for Unconditional Pseudorandom Generators ⋮ Simple Optimal Hitting Sets for Small-Success RL ⋮ 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 ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudorandom generators for space-bounded computation
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- \(\text{RL}\subseteq \text{SC}\)
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Randomness is linear in space
- Relationships between nondeterministic and deterministic tape complexities
- Pseudorandomness for network algorithms
- On recycling the randomness of states in space bounded computation
- Pseudorandomness
- A Sample of Samplers: A Computational Perspective on Sampling
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Tiny families of functions with random properties: A quality-size trade-off for hashing
- Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace
- Pseudorandom generators for width-3 branching programs
- Pseudorandom generators for group products
- Derandomizing polynomial identity tests means proving circuit lower bounds
This page was built for publication:
