![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 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](https://www.pdfsearch.io/img/20a64f65678f8f0e33a20b408d2114b1.jpg) Date: 2011-03-28 06:57:24NP-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 DoktorgradesAdd to Reading ListSource URL: kups.ub.uni-koeln.deDownload Document from Source Website File Size: 899,80 KBShare Document on Facebook
|