Pseudorandomness for Linear Length Branching Programs and Stack Machines
From MaRDI portal
Publication:3167416
DOI10.1007/978-3-642-32512-0_38zbMath1372.68095OpenAlexW98427509MaRDI QIDQ3167416
Periklis A. Papakonstantinou, Andrew Wan, Andrej Bogdanov
Publication date: 2 November 2012
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32512-0_38
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs ⋮ Bounded Independence Plus Noise Fools Products
This page was built for publication: Pseudorandomness for Linear Length Branching Programs and Stack Machines
