On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth
Crossref DOI link: https://doi.org/10.1007/s00224-016-9714-0
Published Online: 2016-10-17
Published Print: 2017-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Razgon, Igor
License valid from 2016-10-17