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 …
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 …
[PDF][PDF] Lower bounds and faster algorithms for equality constraints
P Jonsson, V Lagerkvist - Proceedings of the Twenty-Ninth International …, 2021 - ijcai.org
We study the fine-grained complexity of NP-complete, infinite-domain constraint satisfaction
problems (CSPs) parameterised by a set of firstorder definable relations (with equality) …
problems (CSPs) parameterised by a set of firstorder definable relations (with equality) …
Chain length and csps learnable with few queries
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 …
oracle that answers truthfully certain types of queries. In this paper we focus on partial …
A new characterization of restriction-closed hyperclones
V Lagerkvist - 2020 IEEE 50th International Symposium on …, 2020 - ieeexplore.ieee.org
A hyperoperation is a mapping from a do-main to the powerset of the domain.
Hyperoperations can be composed together to form new hyperoperations, and the resulting …
Hyperoperations can be composed together to form new hyperoperations, and the resulting …
Testing the complexity of a valued CSP language
V Kolmogorov - arXiv preprint arXiv:1803.02289, 2018 - arxiv.org
A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can
express a wide range of discrete optimization problems. A VCSP instance is given by a finite …
express a wide range of discrete optimization problems. A VCSP instance is given by a finite …
Generating random knowledge graphs from rules
GT Glaser - 2024 - elib.uni-stuttgart.de
A knowledge graph is a datastructure that is capable of storing knowledge. Besides that,
there are several methods that use knowledge graphs to derive more information. These …
there are several methods that use knowledge graphs to derive more information. These …
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 …