Generalized Majority-Minority Operations are Tractable

DOI10.2168/LMCS-2(4:1)2006zbMath1127.68039OpenAlexW2011858932MaRDI QIDQ5310666

Victor 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

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

Related Items (12)

Tractability in constraint satisfaction problems: a survey ⋮ Equivariant algorithms for constraint satisfaction problems over coset templates ⋮ Unnamed Item ⋮ Conservative constraint satisfaction re-revisited ⋮ Deciding the Existence of Minority Terms ⋮ Quantified Constraint Satisfaction and the Polynomially Generated Powers Property ⋮ Colouring, constraint satisfaction, and complexity ⋮ The complexity of soft constraint satisfaction ⋮ On the CSP Dichotomy Conjecture ⋮ Quantified constraint satisfaction and the polynomially generated powers property ⋮ Between an n-ary and an n + 1-ary near-unanimity term ⋮ Commutative idempotent groupoids and the constraint satisfaction problem.

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