"\u017D\u00E1k, Stanislav" . "Berlin" . "120667" . "We characterize the hitting sets for read-once (1-branching) branching programs of width 3 by a so-called richness condition which is independent of a rather technical definition of branching programs. The richness property proves to be (in certain sense) necessary and sufficient condition for such hitting sets. In particular, we show that any rich set extended with all strings within Hamming distance of 3 is a hitting set for width-3 1-branching programs. Applying this result to an example of an efficiently constructible rich set from our previous work we achieve an explicit polynomial time construction of an epsilon-hitting set for 1-branching programs of width 3 with acceptance probability epsilon gt 11/12."@en . "10.1007/978-3-642-27660-6_33" . "RIV/67985807:_____/12:00364426!RIV12-AV0-67985807" . . "P(1M0545), P(GAP202/10/1333), Z(AV0Z10300504)" . "978-3-642-27659-0" . . "\u0160pindler\u016Fv Ml\u00FDn" . "A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3" . . . "A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3" . . "Springer-Verlag" . . . "SOFSEM 2012. Theory and Practice of Computer Science" . "A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3"@en . "A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3"@en . "RIV/67985807:_____/12:00364426" . "2"^^ . "2"^^ . "13"^^ . . . . . . "derandomization; hitting set; read-once branching programs; bounded width"@en . . . . . . . "\u0160\u00EDma, Ji\u0159\u00ED" . "[F53CD90B18CA]" . "We characterize the hitting sets for read-once (1-branching) branching programs of width 3 by a so-called richness condition which is independent of a rather technical definition of branching programs. The richness property proves to be (in certain sense) necessary and sufficient condition for such hitting sets. In particular, we show that any rich set extended with all strings within Hamming distance of 3 is a hitting set for width-3 1-branching programs. Applying this result to an example of an efficiently constructible rich set from our previous work we achieve an explicit polynomial time construction of an epsilon-hitting set for 1-branching programs of width 3 with acceptance probability epsilon gt 11/12." . . . "2012-01-21+01:00"^^ . . .