Back to Results
First PageMeta Content
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


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
Add to Reading List

Document Date: 2009-11-10 10:56:36


Open Document

File Size: 152,54 KB

Share Result on Facebook