Generalized Majority-Minority Operations are Tractable
From MaRDI portal
Publication:5310666
DOI10.2168/LMCS-2(4:1)2006zbMath1127.68039MaRDI QIDQ5310666
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
68Q25: Analysis of algorithms and problem complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
08A40: Operations and polynomials in algebraic structures, primal algebras
Related Items
Unnamed Item, Deciding the Existence of Minority Terms, Between an n-ary and an n + 1-ary near-unanimity term, Tractability in constraint satisfaction problems: a survey, Equivariant algorithms for constraint satisfaction problems over coset templates, Colouring, constraint satisfaction, and complexity, Quantified constraint satisfaction and the polynomially generated powers property, Conservative constraint satisfaction re-revisited, Commutative idempotent groupoids and the constraint satisfaction problem., The complexity of soft constraint satisfaction, On the CSP Dichotomy Conjecture, Quantified Constraint Satisfaction and the Polynomially Generated Powers Property