Share This Author
The complexity of surjective homomorphism problems - a survey
Tight rank lower bounds for the Sherali-Adams proof system
Parameterized Proof Complexity
- Stefan S. Dantchev, B. Martin, Stefan Szeider
- Mathematics, Computer Science48th 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.
The computational complexity of disconnected cut and 2K2-partition
The Complexity of Positive First-order Logic without Equality
This work introduces surjective hyper-endomorphisms and uses them in proving a Galois connection that characterises definability in positive equality-free FO.
Towards a Trichotomy for Quantified H-Coloring
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.
The packing chromatic number of the infinite square lattice is between 13 and 15
Discrete Temporal Constraint Satisfaction Problems
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.
Containment, Equivalence and Coreness from CSP to QCSP and beyond
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.
Quantified Constraints in Twenty Seventeen
- B. Martin
- Computer ScienceThe Constraint Satisfaction Problem
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…