This article analyzes to what extent it is possible to efficiently reduce the number of clauses
in NP-hard satisfiability problems without changing the answer. Upper and lower bounds are …

The seminal work of Bencz\'ur and Karger demonstrated cut sparsifiers of near-linear size,
with several applications throughout theoretical computer science. Subsequent extensions …

We continue the investigation of polynomial-time sparsification for NP-complete Boolean
Constraint Satisfaction Problems (CSPs). The goal in sparsification is to reduce the number …

We investigate the List h-Coloring problem, the generalization of graph coloring that asks
whether an input graph G admits a homomorphism to the undirected graph H (possibly with …

Many computational problems arising in, for instance, artificial intelligence can be realized
as infinite-domain constraint satisfaction problems (CSPs) based on partition schemes: a set …

A constraint language Γ has non-redundancy f (n) if every instance of CSP (Γ) with n
variables contains at most f (n) non-redundant constraints. If Γ has maximum arity r then it …

We continue the investigation of polynomial-time sparsification for NP-complete Boolean
Constraint Satisfaction Problems (CSPs). The goal in sparsification is to reduce the number …

We study the complexity of SAT ($\Gamma $) problems for potentially infinite languages
$\Gamma $ closed under variable negation (sign-symmetric languages). Via an algebraic …

The goal of constraint acquisition is to learn exactly a constraint network given access to an
oracle that answers truthfully certain types of queries. In this paper we focus on partial …

In the Boolean maximum constraint satisfaction problem—Max cspγ—one is given a
collection of weighted applications of constraints from a finite constraint language Γ, over a …