Dmitriy Zhuk

According to our database1, Dmitriy Zhuk authored at least 26 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The lattice of clones of self-dual operations collapsed.
Int. J. Algebra Comput., June, 2023

The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation.
ACM Trans. Comput. Log., January, 2023

The complete classification for quantified equality constraints.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Small Promise CSPs that reduce to large CSPs.
Log. Methods Comput. Sci., 2022

QCSP Monsters and the Demise of the Chen Conjecture.
J. ACM, 2022

2021
Strong Subalgebras and the Constraint Satisfaction Problem.
J. Multiple Valued Log. Soft Comput., 2021

The complexity of the Quantified CSP having the polynomially generated powers property.
CoRR, 2021

Small PCSPs that reduce to large CSPs.
CoRR, 2021

The complete classification for quantified equality constraints.
CoRR, 2021

No-Rainbow Problem and the Surjective Constraint Satisfaction Problem.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020
A Proof of the CSP Dichotomy Conjecture.
J. ACM, 2020

No-Rainbow Problem is NP-Hard.
CoRR, 2020

2019
The Number of Clones Determined by Disjunctions of Unary Relations.
Theory Comput. Syst., 2019

The size of generating sets of powers.
J. Comb. Theory, Ser. A, 2019

Existence of cube terms in finite finitely generated clones.
CoRR, 2019

Deciding the existence of minority terms.
CoRR, 2019

2018
A modifiction of the CSP algorithm for infinite languages.
CoRR, 2018

2017
The complexity of quantified constraints.
CoRR, 2017

The Complexity of Quantified Constraints Using the Algebraic Formulation.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

An Algorithm for Constraint Satisfaction Problem.
Proceedings of the 47th IEEE International Symposium on Multiple-Valued Logic, 2017

2015
The Lattice of All Clones of Self-Dual Functions in Three-Valued Logic.
J. Multiple Valued Log. Soft Comput., 2015

Switchability and collapsibility of Gap Algebras.
CoRR, 2015

2014
On Key Relations Preserved by a Weak Near-Unanimity Function.
Proceedings of the IEEE 44th International Symposium on Multiple-Valued Logic, 2014

2013
On the Clones Containing a Near-Unanimity Function.
Proceedings of the 43rd IEEE International Symposium on Multiple-Valued Logic, 2013

2011
The Lattice of the Clones of Self-Dual Functions in Three-Valued Logic.
Proceedings of the 41st IEEE International Symposium on Multiple-Valued Logic, 2011


  Loading...