Tractable Clones of Polynomials over Semigroups

DOI10.1007/11564751_17MaRDI QIDQ3524174zbMATH OpenOpenAlexFDO

Authors Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien

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

Operations and polynomials in algebraic structures, primal algebras (08A40) Applications of universal algebra in computer science (08A70) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1944123
• Asking the Metaquestions in Constraint Tractability
• Constraint satisfaction tractability from semi-lattice operations on infinite sets
• Tractability and learnability arising from algebras with few subpowers
• A new tractable class of constraint satisfaction problems

Cited in

(5)

• scientific article; zbMATH DE number 1944123 (Why is no real title available?)
• Generalized Majority-Minority Operations are Tractable
• Tractability and learnability arising from algebras with few subpowers
• On solvability of systems of polynomial equations
• Recent Results on the Algebraic Approach to the CSP

This page was built for publication: Tractable Clones of Polynomials over Semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524174)