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 …
The power of primitive positive definitions with polynomially many variables
V Lagerkvist, M Wahlström - Journal of Logic and Computation, 2017 - ieeexplore.ieee.org
Two well-studied closure operators for relations are based on existentially quantified
conjunctive formulas, primitive positive (pp) definitions, and primitive positive formulas …
conjunctive formulas, primitive positive (pp) definitions, and primitive positive formulas …
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 …
A preliminary investigation of satisfiability problems not harder than 1-in-3-SAT
V Lagerkvist, B Roy - 41st International Symposium on …, 2016 - drops.dagstuhl.de
The parameterized satisfiability problem over a set of Boolean relations Gamma (SAT
(Gamma)) is the problem of determining whether a conjunctive formula over Gamma has at …
(Gamma)) is the problem of determining whether a conjunctive formula over Gamma has at …
On the strength of uniqueness quantification in primitive positive formulas
V Lagerkvist, G Nordh - arXiv preprint arXiv:1906.07031, 2019 - arxiv.org
Uniqueness quantification ($\exists! $) is a quantifier in first-order logic where one requires
that exactly one element exists satisfying a given property. In this paper we investigate the …
that exactly one element exists satisfying a given property. In this paper we investigate the …
[图书][B] Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems
B Roy - 2020 - books.google.com
In this thesis we study the worst-case complexity ofconstraint satisfaction problems and
some of its variants. We use methods from universal algebra: in particular, algebras of total …
some of its variants. We use methods from universal algebra: in particular, algebras of total …