On the Computational Complexity of Quantified Horn Clauses
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

Marek Karpinski, Hans Kleine Büning, Peter H. Schmitt
On the Computational Complexity of Quantified Horn Clauses
CSL, 1987.

CSL 1987
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{CSL-1987-KarpinskiBS,
	author        = "Marek Karpinski and Hans Kleine Büning and Peter H. Schmitt",
	booktitle     = "{Proceedings of the First Workshop on Computer Science Logic}",
	doi           = "10.1007/3-540-50241-6_34",
	isbn          = "3-540-50241-6",
	pages         = "129--137",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{On the Computational Complexity of Quantified Horn Clauses}",
	volume        = 329,
	year          = 1987,
}

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.