D. N. Zhuk

From MaRDI portal
Person:522227

Available identifiers

zbMath Open zhuk.dmitriy-nWikidataQ106945549 ScholiaQ106945549MaRDI QIDQ522227

List of research outcomes





PublicationDate of PublicationType
Unifying the three algebraic approaches to the CSP via minimal Taylor algebras2024-07-03Paper
Submaximal clones over a three-element set up to minor-equivalence2024-04-08Paper
Constraint satisfaction problem: what makes the problem easy2024-03-24Paper
The lattice of clones of self-dual operations collapsed2023-07-18Paper
QCSP Monsters and the Demise of the Chen Conjecture2023-04-27Paper
Small Promise CSPs that reduce to large CSPs2022-10-06Paper
https://portal.mardi4nfdi.de/entity/Q58636092022-06-03Paper
The complexity of the Quantified CSP having the polynomially generated powers property2021-10-18Paper
The complete classification for quantified equality constraints2021-04-01Paper
Existence of cube terms in finite algebras2021-02-09Paper
QCSP monsters and the demise of the chen conjecture2021-01-19Paper
A Proof of the CSP Dichotomy Conjecture2020-11-11Paper
Deciding the Existence of Minority Terms2020-09-08Paper
Strong subalgebras and the Constraint Satisfaction Problem2020-05-01Paper
No-Rainbow Problem and the Surjective Constraint Satisfaction Problem2020-03-26Paper
The number of clones determined by disjunctions of unary relations2019-09-05Paper
The size of generating sets of powers2019-08-15Paper
QCSP monsters and the demise of the Chen Conjecture2019-06-29Paper
https://portal.mardi4nfdi.de/entity/Q45838032018-09-03Paper
Key (critical) relations preserved by a weak near-unanimity function2017-04-13Paper
The generation of clones with majority operations2014-08-01Paper
The existence of a near-unanimity function is decidable2014-05-08Paper
The cardinality of the set of all clones containing a given minimal clone on three elements2013-01-30Paper
The predicate method to construct the Post lattice2012-06-08Paper
Structure of clones in the precomplete class of self-dual functions in three-valued logic2012-01-17Paper
A criterion for the decidability of the \(A\)-completeness problem for definite automata2012-01-17Paper
Cardinality of the set of all precomplete classes for definite automata2011-06-30Paper
On the classification of Post automaton bases by the decidability of the \(A\)-completeness property for definite automata2010-08-19Paper
A simplified proof of the CSP Dichotomy Conjecture and XY-symmetric operationsN/APaper
$\Pi_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction ProblemN/APaper

Research outcomes over time

This page was built for person: D. N. Zhuk