Igor Razgon. Quasipolynomial Simulation of DNNF by a Non-determinstic Read-Once Branching Program. In Gilles Pesant, editor, Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings. Volume 9255 of Lecture Notes in Computer Science, pages 367-375, Springer, 2015. [doi]
@inproceedings{Razgon15,
title = {Quasipolynomial Simulation of DNNF by a Non-determinstic Read-Once Branching Program},
author = {Igor Razgon},
year = {2015},
doi = {10.1007/978-3-319-23219-5_26},
url = {http://dx.doi.org/10.1007/978-3-319-23219-5_26},
researchr = {https://researchr.org/publication/Razgon15},
cites = {0},
citedby = {0},
pages = {367-375},
booktitle = {Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings},
editor = {Gilles Pesant},
volume = {9255},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-23218-8},
}