Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)
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

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)
ICST, 2011.

SAT 2011
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{SAT-2011-OrdyniakPS,
	author        = "Sebastian Ordyniak and Daniël Paulusma and Stefan Szeider",
	booktitle     = "{Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing}",
	doi           = "10.1007/978-3-642-21581-0_6",
	isbn          = "978-3-642-21580-3",
	pages         = "47--60",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)}",
	volume        = 6695,
	year          = 2011,
}

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.