scientific article; zbMATH DE number 7536107

MaRDI QIDQ5863602

Alexandr Kazda

Publication date: 3 June 2022

Full work available at URL: https://arxiv.org/abs/2002.06083

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityMaltsev conditionlocal to globalweak near unanimityTaylor term

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Equational logic, Mal'tsev conditions (08B05) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (1)

Local–global property for G-invariant terms

Cites Work

• A strong Mal'cev condition for locally finite varieties omitting the unary type
• Existence theorems for weakly symmetric operations
• The wonderland of reflections
• COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS
• Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
• A Subalgebra Intersection Property for Congruence Distributive Varieties
• The structure of finite algebras
• Varieties Obeying Homotopy Laws
• Loop conditions for strongly connected digraphs
• Deciding the Existence of Minority Terms
• DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS

This page was built for publication: