First Page | Document Content | |
---|---|---|
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 WebsiteFile Size: 152,54 KBShare Document on Facebook |
Representative Families and Kernels Fahad Panolan Department of Informatics, University of Bergen, Norway Parameterized Complexity Summer SchoolDocID: 1vk0H - View Document | |
Some open problems in parameterized complexity Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, HungaryDocID: 1v7gN - View Document | |
Lower bounds for polynomial kernelization Michal Pilipczuk Institute of Informatics, University of Warsaw, Poland Parameterized Complexity Summer SchoolDocID: 1uKug - View Document | |
Discrete Applied Mathematics – 429 www.elsevier.com/locate/dam Parameterized complexity of vertex colouring Leizhen Cai ∗DocID: 1uqiK - View Document | |
Parameterized complexity of even/odd subgraph problemsDocID: 1up1m - View Document |