Algebraic approach to approximation

Conference item

Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise CSPs, we propose an algebraic framework for valued promise CSPs.
To every valued promise CSP we associate an algebraic object, its so-called valued minion. Our main result shows that the existence of a homomorphism between the associated valued minions implies a polynomial-time reduction between the original CSPs. We also show that this general reduction theorem includes important inapproximability results, for instance, the inapproximability of almost solvable systems of linear equations beyond the random assignment threshold.

Authors: Barto, L; Butti, S; Kazda, A; Viola, C; Živný, S

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Association for Computing Machinery
• Host title: LICS '24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science
• Journal: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science
• Article number: 10
• Publication date: 2024-07-08
• Acceptance date: 2024-04-15
• Event title: 39th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2024)
• Event location: Tallinn, Estonia
• Event website: https://lics.siglog.org/lics24/
• Event start date: 2024-07-08
• Event end date: 2024-07-12
• DOI: 10.1145/3661814.3662076
• Language: English
• Keywords: polymorphisms; constraint satisfaction; approximation; algebraic approach