Redundancy Is All You Need
J Brakensiek, V Guruswami - arXiv preprint arXiv:2411.03451, 2024 - arxiv.org
The seminal work of Bencz\'ur and Karger demonstrated cut sparsifiers of near-linear size,
with several applications throughout theoretical computer science. Subsequent extensions …
with several applications throughout theoretical computer science. Subsequent extensions …
On redundancy in constraint satisfaction problems
C Carbonnel - 28th International Conference on Principles and …, 2022 - drops.dagstuhl.de
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 …
variables contains at most f (n) non-redundant constraints. If Γ has maximum arity r then it …
Sparsification of SAT and CSP problems via tractable extensions
V Lagerkvist, M Wahlström - ACM Transactions on Computation Theory …, 2020 - dl.acm.org
Unlike polynomial kernelization in general, for which many non-trivial results and methods
exist, only few non-trival algorithms are known for polynomial-time sparsification …
exist, only few non-trival algorithms are known for polynomial-time sparsification …
Fine-grained complexity of constraint satisfaction problems through partial polymorphisms: A survey
M Couceiro, L Haddad… - 2019 IEEE 49th …, 2019 - ieeexplore.ieee.org
Constraint satisfaction problems (CSPs) are combinatorial problems with strong ties to
universal algebra and clone theory. The recently proved CSP dichotomy theorem states that …
universal algebra and clone theory. The recently proved CSP dichotomy theorem states that …
Cnf satisfiability in a subspace and related problems
V Arvind, V Guruswami - Algorithmica, 2022 - Springer
We introduce the problem of finding a satisfying assignment to a CNF formula that must
further belong to a prescribed input subspace. Equivalent formulations of the problem …
further belong to a prescribed input subspace. Equivalent formulations of the problem …
A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms
M Couceiro, L Haddad, V Lagerkvist - … of Multiple-Valued Logic and Soft …, 2022 - hal.science
Constraint satisfaction problems (CSPs) are combinatorial problems with strong ties to
universal algebra and clone theory. The recently proved CSP dichotomy theorem states that …
universal algebra and clone theory. The recently proved CSP dichotomy theorem states that …
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey (Dedicated to the memory of Professor Ivo Rosenberg)
M Couceiro, L Haddad, V Lagerkvist - ISMVL2019-IEEE 49th …, 2019 - inria.hal.science
Constraint satisfaction problems (CSPs) are combi-natorial problems with strong ties to
universal algebra and clone theory. The recently proved CSP dichotomy theorem states that …
universal algebra and clone theory. The recently proved CSP dichotomy theorem states that …