Number of the records: 1  

A Polynomial-Time Construction of a Hitting Set for Read-once Branching Programs of Width 3

  1. 1.
    SYSNO0367350
    TitleA Polynomial-Time Construction of a Hitting Set for Read-once Branching Programs of Width 3
    Author(s) Šíma, Jiří (UIVT-O) RID, SAI, ORCID
    Žák, Stanislav (UIVT-O) SAI, RID
    Source Title Fundamenta Informaticae. Roč. 184, č. 4 (2021), s. 307-354. - : IOS Press
    Document TypeČlánek v odborném periodiku
    Grant GBP202/12/G061 GA ČR - Czech Science Foundation (CSF)
    GAP202/10/1333 GA ČR - Czech Science Foundation (CSF)
    Institutional supportUIVT-O - RVO:67985807
    Languageeng
    CountryNL
    Keywords derandomization * hitting set * read-once branching programs * bounded width * almost k-wise independent set
    URLhttp://dx.doi.org/10.3233/FI-2021-2101
    Permanent Linkhttp://hdl.handle.net/11104/0202062
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.