The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
V Lagerkvist, M Wahlström - ACM Transactions on Computation Theory …, 2021 - dl.acm.org
We study the fine-grained complexity of NP-complete satisfiability (SAT) problems and
constraint satisfaction problems (CSPs) in the context of the strong exponential-time …
constraint satisfaction problems (CSPs) in the context of the strong exponential-time …
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 …
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 …
Which NP-hard SAT and CSP problems admit exponentially improved algorithms?
V Lagerkvist, M Wahlström - arXiv preprint arXiv:1801.09488, 2018 - arxiv.org
We study the complexity of SAT ($\Gamma $) problems for potentially infinite languages
$\Gamma $ closed under variable negation (sign-symmetric languages). Via an algebraic …
$\Gamma $ closed under variable negation (sign-symmetric languages). Via an algebraic …
On the interval of Boolean strong partial clones containing only projections as total operations
M Couceiro, L Haddad, V Lagerqvist… - 2017 IEEE 47th …, 2017 - ieeexplore.ieee.org
A strong partial clone is a set of partial operations closed under composition and containing
all partial projections. Let X be the set of all Boolean strong partial clones whose total …
all partial projections. Let X be the set of all Boolean strong partial clones whose total …
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 …
[PDF][PDF] On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations
F Vandœuvre-les-Nancy Cedex - ida.liu.se
A strong partial clone is a set of partial operations closed under composition and containing
all partial projections. Let X be the set of all Boolean strong partial clones whose total …
all partial projections. Let X be the set of all Boolean strong partial clones whose total …