The Complexity of Equality Constraint Languages

DOI10.1007/11753728_14zbMath1148.68385OpenAlexW1542270663MaRDI QIDQ3434687

Jan Kára, Manuel Bodirsky

Publication date: 2 May 2007

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11753728_14

zbMATH Keywords

computational complexityconstraint satisfactionlogic in computer scienceclones on infinite domains

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Applications of universal algebra in computer science (08A70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

The complexity of equality constraint languages ⋮ Constraint Satisfaction Problems with Infinite Templates

This page was built for publication: The Complexity of Equality Constraint Languages