scientific article; zbMATH DE number 7561716

DOI10.4230/LIPIcs.MFCS.2019.72MaRDI QIDQ5092435

Erhard Aichinger

Publication date: 21 July 2022

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

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

zbMATH Keywords

polynomial equationspolynomial mappingscircuit satisfiabilitysupernilpotent algebras

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Solving a fixed number of equations over finite groups ⋮ Unnamed Item ⋮ Closed sets of finitary functions between products of finite fields of coprime order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some applications of higher commutators in Mal'cev algebras
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• Chevalley's theorem with restricted variables
• The complexity of the equation solvability problem over nilpotent groups
• The complexity of solving equations over finite groups
• Bounding the free spectrum of nilpotent algebras of prime power order
• The complexity of the equation solvability problem over semipattern groups
• Combinatorial Nullstellensatz
• The equation solvability problem over supernilpotent algebras with Mal’cev term
• Complexity of term representations of finitary functions
• Satisfiability in multi-valued circuits
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
• Congruence modular varieties with small free spectra

This page was built for publication: