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

	¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning” DocID: 1qJex - View Document
	Microsoft Word - IBSdoc DocID: 1qERD - View Document
	Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc DocID: 1qzAi - View Document
	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk DocID: 1qorC - View Document