The Complexity of Surjective Constraint Satisfaction Problems: Hardness Results and an Algebraic Framework

This article presents an algebraic framework for proving hardness results on surjective constraint satisfaction problems (CSPs). The framework allows for reductions from classical CSPs to surjective CSPs, unifying and revealing common structure among previously disparate hardness proofs.