A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
ŠÍMA, Jiří, ŽÁK, Stanislav. <em>A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3</em>. Trier, 2010. Electronic Colloquium on Computational Complexity, TR10-088. Dostupné z: http://www.eccc.uni-trier.de/report/2010/088/