BIROn - Birkbeck Institutional Research Online

    No small nondeterministic read-once branching programs for CNFs of bounded treewidth

    Razgon, Igor (2014) No small nondeterministic read-once branching programs for CNFs of bounded treewidth. In: Cygan, M. and Heggernes, P. (eds.) Parameterized and Exact Computation. Lecture Notes in Computer Science 8894. New York, U.S.: Springer, pp. 319-331. ISBN 9783319135236.

    [img]
    Preview
    Text
    15410.pdf - Author's Accepted Manuscript

    Download (303kB) | Preview

    Abstract

    In this paper, given a parameter k, we demonstrate an infinite class of cnfs of treewidth at most k of their primal graphs such that equivalent nondeterministic read-once branching programs (nrobps) are of size at least nck for some universal constant c. Thus we rule out the possibility of fixed-parameter tractable space complexity of nrobps parameterized by the smallest treewidth of equivalent cnfs.

    Metadata

    Item Type: Book Section
    Additional Information: 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers. Series ISSN: 0302-9743. The final publication is available at Springer via the link above.
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 03 Jun 2016 10:03
    Last Modified: 27 Jul 2019 04:40
    URI: http://eprints.bbk.ac.uk/id/eprint/15410

    Statistics

    Downloads
    Activity Overview
    114Downloads
    109Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item