Complexity and Unsolvability Properties of Nilpotency

DOI10.1137/0219002MaRDI QIDQ3490944zbMATH OpenOpenAlexFDO

Authors Irvin Roy Hentzel, D. P. Jacobs

Publication date 1990

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://lib.dr.iastate.edu/math_pubs/140

zbMATH Keywords

solvabilitynilpotency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Hierarchies of computability and definability (03D55) Complexity of computation (including implicit computational complexity) (03D15) General nonassociative rings (17A99)

Recommendations

• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• The complexity of the equation solvability problem over nilpotent groups
• The equation solvability problem over supernilpotent algebras with Mal’cev term
• On Commutative Power-Associative Nilalgebras
• scientific article; zbMATH DE number 3901023

Cited in

(1)

• Probabilistic checking of associativity in algebras

This page was built for publication: Complexity and Unsolvability Properties of Nilpotency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3490944)