Basket

0349417 - ÚI 2011 DE eng V - Research Report
Šíma, Jiří - Žák, Stanislav
A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3.
Trier, 2010. 20 s. Electronic Colloquium on Computational Complexity, TR10-088.
R&D Projects: GA ČR GAP202/10/1333
Institutional research plan: CEZ:AV0Z10300504
Keywords : bounded width * derandomization * Hitting Set * read-once branching program
Subject RIV: IN - Informatics, Computer Science
http://www.eccc.uni-trier.de/report/2010/088/
Permanent Link: http://hdl.handle.net/11104/0189664