3 papers
cs.LO2026
Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
Libor Barto, Maximilian Hadek, Dmitriy Zhuk
We develop a unified framework to characterize the power of higher-level algorithms for the constraint satisfaction problem (CSP), such as -consistency, the Sherali-Adams LP hie…
cs.LO2026
Singleton algorithms for the Constraint Satisfaction Problem
Dmitriy Zhuk
A natural strengthening of an algorithm for the (promise) constraint satisfaction problem is its singleton version: we first fix a variable to an element from its domain, then run…
cs.CC2024
A simplified proof of the CSP Dichotomy Conjecture and XY-symmetric operations
Dmitriy Zhuk
We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for…