Barnaby - PDFSEARCH.IO - Document Search Engine

Barnaby
Results: 156

#	Item
11	First-Order Model Checking Problems Parameterized by the Model? Barnaby Martin Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, U.K. Add to Reading List Source URL: www.bedewell.com - Date: 2009-11-10 10:56:24
12	Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1 Add to Reading List Source URL: orion.math.iastate.edu - Date: 2014-08-22 14:44:47
13	Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:57:12 Computational complexity theory Logic Complexity classes Mathematical logic PSPACE FO Second-order logic P versus NP problem Constraint satisfaction problem NP P Constraint satisfaction
14	The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University, Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-06-03 07:34:14 Computational complexity theory Complexity classes Theory of computation FO PSPACE IP NP P Reduction Homomorphism SO
15	A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2011-07-07 14:48:20 Mathematics Theoretical computer science Abstract algebra FO Finite model theory Sheaf Boolean satisfiability problem Uniform space
16	Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-09-12 12:52:00 Mathematics Morphisms Complexity classes Graph theory Mathematical logic Structure Universal algebra NP-completeness Graph homomorphism Bipartite graph Homomorphism NP
17	QCSP on partially reflexive forests Barnaby Martin? School of Engineering and Computing Sciences, Durham University Science Labs, South Road, Durham, DH1 3LE, UK Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-04-01 20:03:12 Graph theory Mathematics Computational complexity theory Morphisms Graph coloring Tree Reduction Isomorphism Homomorphism Grushko theorem
18	The lattice structure of sets of surjective hyper-operations Barnaby Martin? School of Engineering and Computing Sciences, Durham University Science Labs, South Road, Durham, DH1 3LE, UK Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-06-17 08:45:52 Mathematics Mathematical analysis Functions and mappings Mathematical logic Bijection Surjective function FO Presentation of a group Image
19	A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-04-03 11:35:00 Mathematics Theoretical computer science Abstract algebra FO Finite model theory Sheaf Boolean satisfiability problem Uniform space
20	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 Language: English - 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

UPDATE