Barnaby - PDFSEARCH.IO - Document Search Engine

Barnaby
Results: 156

#	Item
21	Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1 Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2012-06-12 14:31:34 Graph theory Morphisms Graph operations NP-complete problems Graph coloring Graph homomorphism Graph isomorphism Pathwidth Hypergraph Treewidth Cograph Graph
22	Hierarchies in Fragments of Monadic Strict NP Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, U.K. Abstract. We expose a strict hierar Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:42 Graph theory Mathematics Graph coloring Homomorphism Morphisms XTR Order
23	Constraint Satisfaction with Counting Quantifiers⋆ Florent Madelaine1 , Barnaby Martin2⋆⋆ and Juraj Stacho3⋆ ⋆ ⋆ 2 Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2012-03-15 13:21:54 Computational complexity theory Logic Complexity classes Abstraction Metalogic Predicate logic Finite model theory IP FO Quantifier PSPACE-complete Model theory
24	Quantified Constraints on Directed Graphs Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, U.K. Abstract We study the quantified H-colou Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:50 Graph theory Mathematics Discrete mathematics NP-complete problems Morphisms Graph coloring Graph homomorphism Degree Line graph
25	The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin? School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U. Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-03-23 07:22:00 Logic Mathematical logic Mathematics Model theory Predicate logic Finite model theory Automated theorem proving Boolean algebra First-order logic Resolution FO Interpretation
26	The limits of tractability in Resolution-based propositional proof systems Stefan Dantchev and Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-06-15 11:37:40 Model theory Automated theorem proving Resolution First-order logic IP Interpretation
27	Cutting Planes and the Parameter Cutwidth Stefan Dantchev1 and Barnaby Martin2 1 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 Language: English - Date: 2009-11-10 10:55:56 Automated theorem proving Resolution Linear programming IP Inequality
28	QCSP on partially reflexive forests Barnaby Martin Algorithms and Complexity in Durham, Durham University, U.K. CP 2011, Perugia. 14th August 2011. Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-09-13 17:39:08 Complexity classes NP-hardness IP PSPACE-complete NP Reduction PSPACE P FO Circuits over sets of natural numbers True quantified Boolean formula
29	ILP and Cutting Planes Refutation systems Gap theorems Cutting Planes and the Parameter Cutwidth Barnaby Martin (joint work with Stefan Dantchev) Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-07-21 17:54:44 Combinatorial optimization Integer programming Operations research
30	CONSTRAINT SATISFACTION WITH COUNTING QUANTIFIERS BARNABY MARTIN ∗† , FLORENT MADELAINE Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2015-03-30 10:49:56 Complexity classes IP FO PSPACE-complete PSPACE Interpretation NP Quantifier Well-formed formula Generalized geography Linear temporal logic

UPDATE