The Complexity of Constraint Satisfaction Problems (Invited Talk)

DOI10.4230/LIPICS.STACS.2015.2zbMath1355.68111OpenAlexW2296333169MaRDI QIDQ2954979

Manuel Bodirsky

Publication date: 24 January 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/stacs/stacs2015.html#Bodirsky15

zbMATH Keywords

model theoryconstraint satisfactionuniversal algebraclonestemporal and spatial reasoning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70)

Related Items (3)

Semilattice polymorphisms and chordal graphs ⋮ Dismantlability, connectedness, and mixing in relational structures ⋮ Dismantlability, Connectedness, and Mixing in Relational Structures

This page was built for publication: The Complexity of Constraint Satisfaction Problems (Invited Talk)