The property of being polynomial for Mal’tsev constraint satisfaction problems
From MaRDI portal
Publication:3546063
DOI10.1007/s10469-006-0035-2zbMath1164.08307MaRDI QIDQ3546063
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
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.)
Related Items
On m-Junctive Predicates on a Finite Set, Unnamed Item, АЛГЕБРЫ РИСА И КОНГРУЭНЦ-АЛГЕБРЫ РИСА В ОДНОМ КЛАССЕ АЛГЕБР С ОПЕРАТОРОМ И ОСНОВНОЙ ОПЕРАЦИЕЙ ПОЧТИ ЕДИНОГЛАСИЯ, On weak positive predicates over a finite set