![Computational complexity theory / Theory of computation / Theoretical computer science / NP-complete problems / Complexity classes / Logic in computer science / Finite model theory / Parameterized complexity / Resolution / Exponential time hypothesis / Boolean satisfiability problem / Conjunctive normal form Computational complexity theory / Theory of computation / Theoretical computer science / NP-complete problems / Complexity classes / Logic in computer science / Finite model theory / Parameterized complexity / Resolution / Exponential time hypothesis / Boolean satisfiability problem / Conjunctive normal form](https://www.pdfsearch.io/img/cbcd436a821e21d4f5e4c96ed2bbe799.jpg) Date: 2009-11-10 10:56:36Computational complexity theory Theory of computation Theoretical computer science NP-complete problems Complexity classes Logic in computer science Finite model theory Parameterized complexity Resolution Exponential time hypothesis Boolean satisfiability problem Conjunctive normal form | | 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.ukAdd to Reading ListSource URL: www.bedewell.comDownload Document from Source Website File Size: 152,54 KBShare Document on Facebook
|