Showing cs.LOShow all
2 papers · 1 filter
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.LO2025
A categorical perspective on constraint satisfaction: The wonderland of adjunctions
Maximilian Hadek, Tomáš Jakl, Jakub Opršal
The so-called algebraic approach to the constraint satisfaction problem (CSP) has been a prevalent method of the study of complexity of these problems since early 2000's. The core…