A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3
From MaRDI portal
Publication:5448802
DOI10.1007/978-3-540-69507-3_45zbMath1132.68033OpenAlexW1577143859MaRDI QIDQ5448802
Publication date: 7 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_45
Related Items
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 ⋮ Length of polynomials over finite groups ⋮ 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