Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Barto, Libor
and
Pinsker, Michael
2016.
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems.
p.
615.
Chen, Hubie
Valeriote, Matt
and
Yoshida, Yuichi
2016.
Testing Assignments to Constraint Satisfaction Problems.
p.
525.
Bulatov, Andrei A.
2016.
Graphs of relational structures.
p.
642.
Ham, Lucy
2017.
Gap theorems for robust satisfiability: Boolean CSPs and beyond.
Theoretical Computer Science,
Vol. 676,
Issue. ,
p.
69.
Olšák, Miroslav
2017.
The weakest nontrivial idempotent equations.
Bulletin of the London Mathematical Society,
Vol. 49,
Issue. 6,
p.
1028.
Barto, Libor
Opršal, Jakub
and
Pinsker, Michael
2018.
The wonderland of reflections.
Israel Journal of Mathematics,
Vol. 223,
Issue. 1,
p.
363.
Ham, Lucy
and
Jackson, Marcel
2018.
Axiomatisability and hardness for universal Horn classes of hypergraphs.
Algebra universalis,
Vol. 79,
Issue. 2,
Atserias, Albert
and
Ochremiak, Joanna
2019.
Proof Complexity Meets Algebra.
ACM Transactions on Computational Logic,
Vol. 20,
Issue. 1,
p.
1.
Chen, Hubie
Valeriote, Matt
and
Yoshida, Yuichi
2019.
Constant-Query Testability of Assignments to Constraint Satisfaction Problems.
SIAM Journal on Computing,
Vol. 48,
Issue. 3,
p.
1022.
Elmeadawy, Samar
Abdellatif, Akram A.
and
Holzapfel, Florian
2020.
Utilization of Constraint Satisfaction Problem Algorithms in Model-Based Safety Analysis [MBSA].
Barto, Libor
and
Pinsker, Michael
2020.
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems).
SIAM Journal on Computing,
Vol. 49,
Issue. 2,
p.
365.
Abdellatif, Akram Amin
and
Holzapfel, Florian
2020.
Model Based Safety Analysis (MBSA) Tool for Avionics Systems Evaluation.
p.
1.
Behrisch, Mike
and
Vargas-García, Edith
2021.
On a stronger reconstruction notion for monoids and clones.
Forum Mathematicum,
Vol. 33,
Issue. 6,
p.
1487.
OLŠÁK, MIROSLAV
2021.
MALTSEV CONDITIONS FOR GENERAL CONGRUENCE MEET-SEMIDISTRIBUTIVE ALGEBRAS.
The Journal of Symbolic Logic,
Vol. 86,
Issue. 4,
p.
1432.
Lagerkvist, Victor
and
Roy, Biman
2021.
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem.
Journal of Computer and System Sciences,
Vol. 117,
Issue. ,
p.
23.
Raftery, James G.
2022.
Hiroakira Ono on Substructural Logics.
Vol. 23,
Issue. ,
p.
27.
Bulatov, Andrei A.
and
Rafiey, Akbar
2022.
On the complexity of CSP-based ideal membership problems.
p.
436.
Bharathi, Arpitha P.
and
Mastrolilli, Monaldo
2022.
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism.
SIAM Journal on Discrete Mathematics,
Vol. 36,
Issue. 3,
p.
1800.
Bulatov, Andrei A.
2024.
Graphs of finite algebras: edges, and connectivity.
Algebra universalis,
Vol. 85,
Issue. 4,
Butti, Silvia
and
Dalmau, Víctor
2024.
The Complexity of the Distributed Constraint Satisfaction Problem.
Theory of Computing Systems,
Vol. 68,
Issue. 4,
p.
838.