The following pages link to Dmitriy N. Zhuk (Q522227):
Displaying 24 items.
- Key (critical) relations preserved by a weak near-unanimity function (Q522228) (← links)
- Cardinality of the set of all precomplete classes for definite automata (Q548746) (← links)
- (Q656305) (redirect page) (← links)
- Structure of clones in the precomplete class of self-dual functions in three-valued logic (Q656306) (← links)
- A criterion for the decidability of the \(A\)-completeness problem for definite automata (Q656372) (← links)
- The cardinality of the set of all clones containing a given minimal clone on three elements (Q1935019) (← links)
- Existence of cube terms in finite algebras (Q2226982) (← links)
- The size of generating sets of powers (Q2318479) (← links)
- The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
- The existence of a near-unanimity function is decidable (Q2449447) (← links)
- The generation of clones with majority operations (Q2510717) (← links)
- The predicate method to construct the Post lattice (Q2889730) (← links)
- On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata (Q3585192) (← links)
- (Q4583803) (← links)
- Small Promise CSPs that reduce to large CSPs (Q5043583) (← links)
- Deciding the Existence of Minority Terms (Q5118446) (← links)
- A Proof of the CSP Dichotomy Conjecture (Q5133982) (← links)
- QCSP monsters and the demise of the chen conjecture (Q5144900) (← links)
- (Q5863609) (← links)
- QCSP Monsters and the Demise of the Chen Conjecture (Q5889780) (← links)
- The lattice of clones of self-dual operations collapsed (Q6116396) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
- Submaximal clones over a three-element set up to minor-equivalence (Q6203757) (← links)
- The complete classification for quantified equality constraints (Q6364329) (← links)
