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

First Page		Document Content
Date: 2009-11-10 10:56:36 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 Source URL: www.bedewell.com Download Document from Source Website File Size: 152,54 KB Share Document on Facebook

	workplace with digital tablet, notebook and coffee cup DocID: 1rpIg - View Document
	Categorematic Unreducible Polyadic Quantifiers in Lexical Resource Semantics Frank Richter Goethe Universität Frankfurt a.M. HeadLex 2016, Warsaw DocID: 1rjZ3 - View Document
	A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin DocID: 1rd10 - View Document
	Integrating Categorematic Unreducible Polyadic Quantifiers in LRS Frank Richter∗ Introduction This paper has two goals: On the technical side, it presents a general integration of polyadic quantification in Lexical Res DocID: 1ratm - View Document
	Model theory of finite and pseudofinite groups Dugald Macpherson∗, School of Mathematics, University of Leeds, Leeds LS2 9JT, UK, DocID: 1qU5n - View Document