A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3
From MaRDI portal
Publication:2891385
DOI10.1007/978-3-642-27660-6_33zbMath1302.68118OpenAlexW1245159845MaRDI QIDQ2891385
Publication date: 15 June 2012
Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_33
Related Items
Pseudorandom generators for combinatorial checkerboards ⋮ Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs ⋮ A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
Cites Work
- Unnamed Item
- Pseudorandom generators for space-bounded computation
- Hardness vs randomness
- On beating the hybrid argument
- Pseudorandom Generators for Polynomial Threshold Functions
- Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs
- Pseudorandom Generators for Regular Branching Programs
- Improved Pseudorandom Generators for Depth 2 Circuits
- Simple Constructions of Almost k-wise Independent Random Variables
- Branching Programs and Binary Decision Diagrams
- Pseudorandom generators for group products
- A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3