Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Willem Heijltjes, Dominic J. D. Hughes
Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets
LICS, 2015.

LICS 2015
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{LICS-2015-HeijltjesH,
	author        = "Willem Heijltjes and Dominic J. D. Hughes",
	booktitle     = "{Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science}",
	doi           = "10.1109/LICS.2015.18",
	isbn          = "978-1-4799-8875-4",
	pages         = "80--91",
	publisher     = "{IEEE}",
	title         = "{Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets}",
	year          = 2015,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.