COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS

DOI10.1142/S0218196713500343zbMath1276.08002OpenAlexW1992217715MaRDI QIDQ2854972

Jonah Horowitz

Publication date: 24 October 2013

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196713500343

zbMATH Keywords

intractabilitytractabilityedge termMal'tsev termnear unanimityMal'tsev conditions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Equational logic, Mal'tsev conditions (08B05) Equational classes, universal algebra in model theory (03C05)

Related Items (9)

Local–global property for G-invariant terms ⋮ Unnamed Item ⋮ Deciding the Existence of Minority Terms ⋮ Existence of cube terms in finite algebras ⋮ Testing for a semilattice term ⋮ DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS ⋮ Mal'tsev condition satisfaction problems for conditions which imply edge terms ⋮ Polynomial-time tests for difference terms in idempotent varieties ⋮ Idempotent n -permutable varieties

Cites Work

• On \(n\)-permutable congruences
• Functionally complete algebras generating distributive and permutable classes
• Varieties with few subalgebras of powers
• ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
• COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
• The structure of finite algebras
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

This page was built for publication: COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS