Generalized Majority-Minority Operations are Tractable

DOI10.2168/LMCS-2(4:1)2006MaRDI QIDQ5310666zbMATH OpenOpenAlexFDO

Authors Víctor Dalmau

Publication date 11 October 2007

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-2(4:1)2006

Mathematics Subject Classification ID

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

Recommendations

• Asking the Metaquestions in Constraint Tractability
• Tractable Clones of Polynomials over Semigroups
• Constraint satisfaction tractability from semi-lattice operations on infinite sets
• Tractability in constraint satisfaction problems: a survey
• Tractability and learnability arising from algebras with few subpowers

Cited in

(13)

• Commutative idempotent groupoids and the constraint satisfaction problem.
• Majority functions on structures with finite duality
• The complexity of soft constraint satisfaction
• Tractability in constraint satisfaction problems: a survey
• On the CSP Dichotomy Conjecture
• Equivariant algorithms for constraint satisfaction problems over coset templates
• Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
• Colouring, constraint satisfaction, and complexity
• scientific article; zbMATH DE number 7359806 (Why is no real title available?)
• Deciding the existence of minority terms
• Quantified constraint satisfaction and the polynomially generated powers property
• Between an n-ary and an n + 1-ary near-unanimity term
• Conservative constraint satisfaction re-revisited

This page was built for publication: Generalized Majority-Minority Operations are Tractable

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