| Publication | Date of Publication | Type |
|---|
Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
TheoretiCS | 2024-07-03 | Paper |
Submaximal clones over a three-element set up to minor-equivalence
Algebra Universalis | 2024-04-08 | Paper |
Constraint satisfaction problem: what makes the problem easy
International Congress of Mathematicians | 2024-03-24 | Paper |
The lattice of clones of self-dual operations collapsed
International Journal of Algebra and Computation | 2023-07-18 | Paper |
QCSP Monsters and the Demise of the Chen Conjecture
Journal of the ACM | 2023-04-27 | Paper |
Small Promise CSPs that reduce to large CSPs
Logical Methods in Computer Science | 2022-10-06 | Paper |
scientific article; zbMATH DE number 7536113 (Why is no real title available?)
| 2022-06-03 | Paper |
The complexity of the Quantified CSP having the polynomially generated powers property
| 2021-10-18 | Paper |
The complete classification for quantified equality constraints
| 2021-04-01 | Paper |
Existence of cube terms in finite algebras
Algebra Universalis | 2021-02-09 | Paper |
QCSP monsters and the demise of the chen conjecture
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A proof of the CSP dichotomy conjecture
Journal of the ACM | 2020-11-11 | Paper |
Deciding the existence of minority terms
Canadian Mathematical Bulletin | 2020-09-08 | Paper |
Strong subalgebras and the Constraint Satisfaction Problem
| 2020-05-01 | Paper |
No-Rainbow Problem and the Surjective Constraint Satisfaction Problem
| 2020-03-26 | Paper |
The number of clones determined by disjunctions of unary relations
Theory of Computing Systems | 2019-09-05 | Paper |
The size of generating sets of powers
Journal of Combinatorial Theory. Series A | 2019-08-15 | Paper |
QCSP monsters and the demise of the Chen Conjecture
| 2019-06-29 | Paper |
The lattice of all clones of self-dual functions in three-valued logic
| 2018-09-03 | Paper |
Key (critical) relations preserved by a weak near-unanimity function
Algebra Universalis | 2017-04-13 | Paper |
The generation of clones with majority operations
Algebra Universalis | 2014-08-01 | Paper |
The existence of a near-unanimity function is decidable
Algebra Universalis | 2014-05-08 | Paper |
The cardinality of the set of all clones containing a given minimal clone on three elements
Algebra Universalis | 2013-01-30 | Paper |
The predicate method to construct the Post lattice
Discrete Mathematics and Applications | 2012-06-08 | Paper |
Structure of clones in the precomplete class of self-dual functions in three-valued logic
Doklady Mathematics | 2012-01-17 | Paper |
A criterion for the decidability of the \(A\)-completeness problem for definite automata
Doklady Mathematics | 2012-01-17 | Paper |
Cardinality of the set of all precomplete classes for definite automata
Journal of Mathematical Sciences (New York) | 2011-06-30 | Paper |
On the classification of Post automaton bases by the decidability of the \(A\)-completeness property for definite automata
Discrete Mathematics and Applications | 2010-08-19 | Paper |
A simplified proof of the CSP Dichotomy Conjecture and XY-symmetric operations
| N/A | Paper |
$\Pi_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
| N/A | Paper |
