Willem Heijltjes, Dominic J. D. Hughes. Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. pages 80-91, IEEE, 2015. [doi]
@inproceedings{HeijltjesH15,
title = {Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets},
author = {Willem Heijltjes and Dominic J. D. Hughes},
year = {2015},
doi = {10.1109/LICS.2015.18},
url = {http://dx.doi.org/10.1109/LICS.2015.18},
researchr = {https://researchr.org/publication/HeijltjesH15},
cites = {0},
citedby = {0},
pages = {80-91},
booktitle = {30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015},
publisher = {IEEE},
isbn = {978-1-4799-8875-4},
}