Constraint Satisfaction Problems over Finite Structures

We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a natural algebraic question: which finite algebras admit only poly...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Barto, Libor, DeMeo, William, Mottet, Antoine
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Algebra Computational complexity Computer science Systematics
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!