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

Igor Razgon

doi:10.1007/978-3-319-23219-5_26

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

Igor Razgon

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English
Title of host publication	Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings
Editors	Gilles Pesant
Publisher	Springer Verlag
Pages	367-375
Number of pages	9
ISBN (Print)	9783319232188
DOIs	https://doi.org/10.1007/978-3-319-23219-5_26
State	Published - 1 Jan 2015
Externally published	Yes
Event	21st International Conference on the Principles and Practice of Constraint Programming, CP 2015 - Cork, Ireland Duration: 31 Aug 2015 → 4 Sep 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9255
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st International Conference on the Principles and Practice of Constraint Programming, CP 2015
Country/Territory	Ireland
City	Cork
Period	31/08/15 → 4/09/15

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-23219-5_26

Cite this

Razgon, I. (2015). Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program. In G. Pesant (Ed.), Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings (pp. 367-375). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9255). Springer Verlag. https://doi.org/10.1007/978-3-319-23219-5_26

Razgon, Igor. / Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program. Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings. editor / Gilles Pesant. Springer Verlag, 2015. pp. 367-375 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1b1c13e72b004642968def318026b5ea,

title = "Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program",

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.",

author = "Igor Razgon",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 21st International Conference on the Principles and Practice of Constraint Programming, CP 2015 ; Conference date: 31-08-2015 Through 04-09-2015",

year = "2015",

month = jan,

day = "1",

doi = "10.1007/978-3-319-23219-5_26",

language = "English",

isbn = "9783319232188",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "367--375",

editor = "Gilles Pesant",

booktitle = "Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings",

address = "Germany",

}

Razgon, I 2015, Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program. in G Pesant (ed.), Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9255, Springer Verlag, pp. 367-375, 21st International Conference on the Principles and Practice of Constraint Programming, CP 2015, Cork, Ireland, 31/08/15. https://doi.org/10.1007/978-3-319-23219-5_26

Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program. / Razgon, Igor.
Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings. ed. / Gilles Pesant. Springer Verlag, 2015. p. 367-375 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9255).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Razgon, Igor

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84944549387&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-23219-5_26

DO - 10.1007/978-3-319-23219-5_26

M3 - Conference contribution

AN - SCOPUS:84944549387

SN - 9783319232188

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 367

EP - 375

BT - Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings

A2 - Pesant, Gilles

PB - Springer Verlag

T2 - 21st International Conference on the Principles and Practice of Constraint Programming, CP 2015

Y2 - 31 August 2015 through 4 September 2015

ER -

Razgon I. Quasipolynomial simulation of DNNF by a non-determinstic read-once branching program. In Pesant G, editor, Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings. Springer Verlag. 2015. p. 367-375. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-23219-5_26

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this