
Tractability of Quantified Temporal Constraints To The Max
A temporal constraint language is a set of relations that are firstorde...
read it

Sparsification Lower Bounds for List HColoring
We investigate the List HColoring problem, the generalization of graph ...
read it

Semantic Width and the FixedParameter Tractability of Constraint Satisfaction Problems
Constraint satisfaction problems (CSPs) are an important formal framewor...
read it

Algebraic Global Gadgetry for Surjective Constraint Satisfaction
The constraint satisfaction problem (CSP) on a finite relational structu...
read it

Bestcase and Worstcase Sparsifiability of Boolean CSPs
We continue the investigation of polynomialtime sparsification for NPc...
read it

Homomorphisms are indeed a good basis for counting: Three fixedtemplate dichotomy theorems, for the price of one
Many natural combinatorial quantities can be expressed by counting the n...
read it

Asking the metaquestions in constraint tractability
The constraint satisfaction problem (CSP) involves deciding, given a set...
read it

An Algebraic Hardness Criterion for Surjective Constraint Satisfaction
The constraint satisfaction problem (CSP) on a relational structure B is...
read it

Beyond QResolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction
We consider the quantified constraint satisfaction problem (QCSP) which ...
read it

On the Complexity of Existential Positive Queries
We systematically investigate the complexity of model checking the exist...
read it

Arc Consistency and Friends
A natural and established way to restrict the constraint satisfaction pr...
read it
Hubie Chen
is this you? claim profile