Tractable Clones of Polynomials over Semigroups

DOI10.1007/11564751_17zbMath1153.68455MaRDI QIDQ3524174

Ricard Gavaldà, Pascal Tesson, Denis Thérien, Victor Dalmau

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_17

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

08A40: Operations and polynomials in algebraic structures, primal algebras

Related Items

Recent Results on the Algebraic Approach to the CSP, On solvability of systems of polynomial equations