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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13
Hlavní autori:	Barto, Libor, DeMeo, William, Mottet, Antoine
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 29.06.2021
Predmet:	Algebra Computational complexity Computer science Systematics
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!