NP-completeness of the alphabetical satisfiability problem for trace equations
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

Luca Breveglieri, Alessandra Cherubini, Claudia Di Nucci, Emanuele Rodaro
NP-completeness of the alphabetical satisfiability problem for trace equations
AFL, 2008.

AFL 2008
DBLP
Scholar
Full names Links ISxN
@inproceedings{AFL-2008-BreveglieriCNR,
	author        = "Luca Breveglieri and Alessandra Cherubini and Claudia Di Nucci and Emanuele Rodaro",
	booktitle     = "{Proceedings of the 12th International Conference on Automata and Formal Languages}",
	isbn          = "978-963-311-367-7",
	pages         = "111--121",
	title         = "{NP-completeness of the alphabetical satisfiability problem for trace equations}",
	year          = 2008,
}

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.