Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades

First Page		Document Content
Date: 2011-03-28 06:57:24 NP-complete problems Logic in computer science Complexity classes Boolean algebra 2-satisfiability Boolean satisfiability problem Conjunctive normal form Outerplanar graph Planar graph Theoretical computer science Graph theory Computational complexity theory		Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades Add to Reading List Source URL: kups.ub.uni-koeln.de Download Document from Source Website File Size: 899,80 KB Share Document on Facebook

	The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V´ıt Jel´ınek1 , Eva Jel´ınkov´a1 , Jan Kratochv´ıl12 , Bernard Lidick´ y1 , Marek Tesaˇr1 , Tom´aˇs 12 Vyskoˇcil DocID: 1rnTu - View Document
	The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin DocID: 1rfkH - View Document
	Straight-line Drawings of 1-planar Graphs Peter Eades1 , Seok-Hee Hong1 , Giuseppe Liotta2 , and Sheung-Hung Poon3 1 3 DocID: 1qwmK - View Document
	On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs ? M. A. Bekos1 , S. Cornelsen2 , L. Grilli3 , S.-H. Hong4 , M. Kaufmann1 1 arXiv:1409.0461v1 [cs.CG] 1 Sep 2014 DocID: 1qv3k - View Document
	Fixed-parameter algorithms for protein similarity search under mRNA structure constraints Guillaume Blin1 , Guillaume Fertin1 , Danny Hermelin2 , and St´ephane Vialette3 1 DocID: 1qkxB - View Document