Towards a Trichotomy for Quantified H-Coloring

@inproceedings{Martin2006TowardsAT,
  title={Towards a Trichotomy for Quantified H-Coloring},
  author={B. Martin and Florent R. Madelaine},
  booktitle={CiE},
  year={2006}
}
Hell and Nesetřil proved that the H-colouring problem is NP-complete if, and only if, H is bipartite. In this paper, we investigate the complexity of the quantified H-colouring problem (a restriction of the quantified constraint satisfaction problem to undirected graphs). We introduce this problem using a new two player colouring game. We prove that the quantified H-colouring problem is: 1. tractable, if H is bipartite; 2. NP-complete, if H is not bipartite and not connected; and, 3… Expand

Topics from this paper

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
TLDR
The largest part of this work is the algebraic classification of precisely which semicomplete digraphs enjoy only essentially unary polymorphisms, which is combinatorially interesting in its own right. Expand
Constraint Satisfaction with Counting Quantifiers
TLDR
This work completes the classification of clique templates by proving a full trichotomy for all possible combinations of counting quantifiers and clique sizes, and obtains a full dichotomy for ∃ and ∃ ≥ 2 quantifiers on finite graphs. Expand
QCSP on Partially Reflexive Forests
TLDR
In the case of partially reflexive paths, this work gives a refinement of the complexity-theoretic dichotomy: QCSP(H) is either in NL or is Pspace-complete. Expand
QCSP on Semicomplete Digraphs
TLDR
The largest part of this work is the algebraic classification of precisely which semicompletes enjoy only essentially unary polymorphisms, which is combinatorially interesting in its own right. Expand
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
  • B. Martin
  • Computer Science, Mathematics
  • ArXiv
  • 2008
TLDR
A complete complexity classification is proved for this problem when A ranges over 1.) boolean structures and 2.) digraphs of size (less than or equal to) three. Expand
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation
TLDR
It is proved a complexity-theoretic converse in the case of infinite constraint languages encoded in propositional logic, that if Inv(A) satisfies the exponentially generated powers property (EGP), then QCSP(Inv(A)) is co-NP-hard. Expand
Quantified Constraints and Containment Problems
TLDR
This work gives an algorithm that determines whether "phi implies psi" is true in all structures (models) and shows that the entailment problem for positive first-order logic is undecidable. Expand
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP
TLDR
It is proved that partially reflexive paths bequeath a set of idem potent polymorphisms whose associated clone algebra has: either the polynomially generated powers property (PGP), or the exponentially generated power property (EGP). Expand
QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability
TLDR
A complexity-theoretic dichotomy is obtained: QCSP is either in NL or is NP-hard; the separating conditions are somewhat esoteric hence the epithet “wavy line of tractability”. Expand
The complexity of constraint satisfaction games and QCSP
TLDR
The quantified constraint satisfaction framework is used to study how the complexity of deciding such a game depends on the parameter set of allowed predicates, and it is shown that the complexity is determined by the surjective polymorphisms of the constraint predicates. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 15 REFERENCES
On the complexity of H-coloring
TLDR
The natural conjecture, formulated in several sources, asserts that the H-coloring problem is NP-complete for any non-bipartite graph H, and a proof of this conjecture is given. Expand
A dichotomy theorem for constraints on a three-element set
  • A. Bulatov
  • Mathematics, Computer Science
  • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
TLDR
Every subclass of the CSP defined by a set of allowed constraints is either tractable or NP-complete, and the criterion separating them is that conjectured by Bulatov et al. (2001). Expand
The complexity of satisfiability problems
TLDR
An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete. Expand
Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP
TLDR
This paper is interested in restrictions on the types of constraint relations in CSP instances, and whether other closure properties may generate tractable subclasses of CSP. Expand
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
TLDR
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy. Expand
On the Algebraic Structure of Combinatorial Problems
  • P. Jeavons
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1998
TLDR
A general algebraic formulation for a wide range of combinatorial problems including Satisfiability, Graph Colorability and Graph Isomorphism is described, and it is demonstrated that the complexity of solving this decision problem is determined in many cases by simple algebraic properties of the relational structures involved. Expand
Collapsibility and Consistency in Quantified Constraint Satisfaction
TLDR
This work uses two concepts inspired by consistency to derive proofs of polynomial-time tractability and corresponding algorithms for certain cases of the quantified constraint satisfaction problem (QCSP) where the types of allowed relations are restricted. Expand
Classifying the Complexity of Constraints Using Finite Algebras
TLDR
It is shown that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra is explored. Expand
Quantified Constraints: Algorithms and Complexity
TLDR
This paper considers a more general framework for constraint satisfaction problems which allows arbitrary quantifiers over constrained variables, rather than just existential quantifiers, and shows that the complexity of such extended problems is determined by the surjective polymorphisms of the constraint predicates. Expand
A Dichotomy Theorem for Learning Quantified Boolean Formulas
  • V. Dalmau
  • Mathematics, Computer Science
  • COLT
  • 1997
TLDR
The following dichotomy theorem is proved: for any set of basic boolean functions, the resulting set of formulas is either polynomially learnable from equivalence queries alone or else it is not PAC-predictable even with membership queries under cryptographic assumptions. Expand
...
1
2
...