The property of being polynomial for Mal’tsev constraint satisfaction problems

DOI10.1007/s10469-006-0035-2zbMath1164.08307MaRDI QIDQ3546063

Andrei A. Bulatov

Publication date: 18 December 2008

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-006-0035-2

zbMATH Keywords

computational complexity; CSP; Mal'tsev operation

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

08A70: Applications of universal algebra in computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)