BIROn - Birkbeck Institutional Research Online

    Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program

    Razgon, Igor (2015) Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program. In: Pesant, G. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 9255. New York, U.S.: Springer, pp. 367-375. ISBN 9783319232188.

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

    Download (243kB) | Preview

    Abstract

    We prove that dnnfs can be simulated by Non-deterministic Read-Once Branching Programs (nrobps) of quasi-polynomial size. As a result, all the exponential lower bounds for nrobps immediately apply for dnnfs.

    Metadata

    Item Type: Book Section
    Additional Information: 21st International Conference, CP 2015, Cork, Ireland, August 31 -- September 4, 2015, Proceedings. 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 09:44
    Last Modified: 03 Jun 2016 09:44
    URI: http://eprints.bbk.ac.uk/id/eprint/15408

    Statistics

    Downloads
    Activity Overview
    71Downloads
    86Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item