Pages that link to "Item:Q3167416"
From MaRDI portal
The following pages link to Pseudorandomness for Linear Length Branching Programs and Stack Machines (Q3167416):
Displaying 7 items.
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- Pseudorandom Bits for Oblivious Branching Programs (Q5053059) (← links)
- Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
- Improved pseudorandomness for unordered branching programs through local monotonicity (Q5230303) (← links)
- Pseudorandom Generators for Read-Once Monotone Branching Programs (Q6090916) (← links)