Basket

0367350 - ÚI 2022 RIV NL eng J - Journal Article
Šíma, Jiří - Žák, Stanislav
A Polynomial-Time Construction of a Hitting Set for Read-once Branching Programs of Width 3.
Fundamenta Informaticae. Roč. 184, č. 4 (2021), s. 307-354. ISSN 0169-2968. E-ISSN 1875-8681
R&D Projects: GA ČR GBP202/12/G061; GA ČR GAP202/10/1333
Institutional support: RVO:67985807
Keywords : derandomization * hitting set * read-once branching programs * bounded width * almost k-wise independent set
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 1.166, year: 2021
Method of publishing: Limited access
http://dx.doi.org/10.3233/FI-2021-2101
Permanent Link: http://hdl.handle.net/11104/0202062