Pages that link to "Item:Q5130845"
From MaRDI portal
The following pages link to Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845):
Displaying 11 items.
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- Pseudorandomness for Linear Length Branching Programs and Stack Machines (Q3167416) (← links)
- Pseudorandom Bits for Oblivious Branching Programs (Q5053059) (← links)
- (Q5092453) (← links)
- (Q5092457) (← links)
- Simple Optimal Hitting Sets for Small-Success RL (Q5115702) (← links)
- Improved pseudorandomness for unordered branching programs through local monotonicity (Q5230303) (← links)
- A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 (Q5862347) (← links)
- Pseudorandom Generators for Read-Once Monotone Branching Programs (Q6090916) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q6623584) (← links)