Complexity of term representations of finitary functions

DOI10.1142/S0218196718500480zbMath1405.08005arXiv1709.01759OpenAlexW3098726882MaRDI QIDQ4687485

Erhard Aichinger, Nebojša Mudrinski, Jakub Opršal

Publication date: 12 October 2018

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

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

zbMATH Keywords

termcomplexityterm equivalenceprimal algebraterm functionsupernilpotent algebra

Mathematics Subject Classification ID

Structure theory of algebraic structures (08A05) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (6)

Bounding the free spectrum of nilpotent algebras of prime power order ⋮ Superassociative structures of terms and formulas defined by transformations preserving a partition ⋮ Three concepts of nilpotence in loops ⋮ Unnamed Item ⋮ Congruence preserving expansions of nilpotent algebras ⋮ Menger systems of idempotent cyclic and weak near-unanimity multiplace functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A relational description of higher commutators in Mal'cev varieties
• Length of polynomials over finite groups
• Some applications of higher commutators in Mal'cev algebras
• Free spectra of nilpotent varieties
• Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
• COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
• The structure of finite algebras
• Reducibility among Combinatorial Problems
• SUPERNILPOTENCE PREVENTS DUALIZABILITY
• On the Direct Decomposition of Nilpotent Expanded Groups
• EVERY (k + 1)-AFFINE COMPLETE NILPOTENT GROUP OF CLASS k IS AFFINE COMPLETE
• Congruence modular varieties with small free spectra

This page was built for publication: Complexity of term representations of finitary functions