scientific article; zbMATH DE number 7561738
From MaRDI portal
Publication:5092457
DOI10.4230/LIPIcs.CCC.2020.10MaRDI QIDQ5092457
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Simple Optimal Hitting Sets for Small-Success RL ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
Cites Work
- Pseudorandom generators for space-bounded computation
- On read-once vs. multiple access to randomness in logspace
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension
- Randomness is linear in space
- Pseudorandomness for network algorithms
- Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs
- Simplified Derandomization of BPP Using a Hitting Set Generator
- Pseudorandom generators for low degree polynomials
- Relativization of questions about log space computability
- Weak Random Sources, Hitting Sets, and BPP Simulations
- Tiny families of functions with random properties: A quality-size trade-off for hashing
- Simple Optimal Hitting Sets for Small-Success RL
- Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs
- Pseudorandom generators for width-3 branching programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
