B. Martin | Semantic Scholar

Publications
Influence

The complexity of surjective homomorphism problems - a survey

M. Bodirsky, J. Kára, B. Martin
Mathematics
Discret. Appl. Math.
27 April 2011

View PDF on arXiv

Tight rank lower bounds for the Sherali-Adams proof system

Stefan S. Dantchev, B. Martin, Mark Nicholas Charles Rhodes
Mathematics
Theor. Comput. Sci.
1 May 2009

View via Publisher

Parameterized Proof Complexity

Stefan S. Dantchev, B. Martin, Stefan Szeider
Mathematics, Computer Science
48th Annual IEEE Symposium on Foundations of…
21 October 2007

A dichotomy theorem is established that splits the exponential case of Riis’s complexity gap theorem into two subcases, one that admits proofs of size f(k)nO(1) and one that does not and how the set of parameterized contradictions may be embedded into theSet of (ordinary) contradictions by the addition of new axioms.

View on IEEE

The computational complexity of disconnected cut and 2K2-partition

B. Martin, D. Paulusma
Mathematics
J. Comb. Theory, Ser. B
25 April 2011

View PDF on arXiv

The Complexity of Positive First-order Logic without Equality

B. Martin, Jos Martin
Mathematics
24th Annual IEEE Symposium on Logic In Computer…
11 August 2009

This work introduces surjective hyper-endomorphisms and uses them in proving a Galois connection that characterises definability in positive equality-free FO.

View on ACM

Towards a Trichotomy for Quantified H-Coloring

B. Martin, Florent R. Madelaine
Mathematics
CiE
30 June 2006

The complexity of the quantified H-colouring problem is investigated using a new two player colouring game and it is conjecture that the last case extends to all non-bipartite connected graphs.

View via Publisher

The packing chromatic number of the infinite square lattice is between 13 and 15

B. Martin, F. Raimondi, Taolue Chen, Jos Martin
Computer Science
Discret. Appl. Math.
8 October 2015

View PDF on arXiv

Discrete Temporal Constraint Satisfaction Problems

M. Bodirsky, B. Martin, Antoine Mottet
Computer Science, Mathematics
J. ACM
30 March 2015

It is proved that every discrete temporal CSP is in P or NP-complete, unless it can be formulated as a finite domain CSP, in which case the computational complexity is not known in general.

View on ACM

Containment, Equivalence and Coreness from CSP to QCSP and beyond

Florent R. Madelaine, B. Martin
Computer Science
CP
26 April 2012

Previous results on containment, equivalence and "coreness" for QCSP are recalled and extended before initiating a preliminary study of cores for QC SP which turns out to be more elusive.

View PDF on arXiv

Quantified Constraints in Twenty Seventeen

B. Martin
Computer Science
The Constraint Satisfaction Problem
2017

I present a survey of recent advances in the algorithmic and computational complexity theory of non-Boolean Quantified Constraint Satisfaction Problems, incorporating some more modern research…

View via Publisher