BIROn - Birkbeck Institutional Research Online

    On the read-once property of branching programs and CNFs of bounded treewidth

    Razgon, Igor (2015) On the read-once property of branching programs and CNFs of bounded treewidth. Algorithmica 75 (2), pp. 277-294. ISSN 0178-4617.

    15405.pdf - Author's Accepted Manuscript

    Download (379kB) | Preview


    for non-deterministic (syntactic) read-once branching programs (nrobps) on functions expressible as cnfs with treewidth at most k of their primal graphs. This lower bound rules out the possibility of fixed-parameter space complexity of nrobps parameterized by k. We use lower bound for nrobps to obtain a quasi-polynomial separation between Free Binary Decision Diagrams and Decision Decomposable Negation Normal Forms, essentially matching the existing upper bound introduced by Beame et al. (Proceedings of the twenty-ninth conference on uncertainty in artificial intelligence, Bellevue, 2013) and thus proving the tightness of the latter.


    Item Type: Article
    Additional Information: The final publication is available at Springer via the link above.
    Keyword(s) / Subject(s): Read-once branching programs, CNFs, Bounded treewidth, Parameterized complexity, Space complexity, Lower bounds
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Administrator
    Date Deposited: 03 Jun 2016 09:32
    Last Modified: 09 Aug 2023 12:38


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item