The complexity of inversion in groups

DOI10.1007/S10469-024-09730-9MaRDI QIDQ6199353zbMATH OpenOpenAlexFDO

Authors P. E. Alaev

Publication date 23 February 2024

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10469-024-09730-9

zbMATH Keywords

computable groupinversion operationsprimitive recursive functionquotient structure

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Recommendations

• Inversion operations in algebraic structures
• On the computability of the terms and quotient groups by them in the upper and lower central series of the computable groups
• On the computability of a class of periodic abelian groups
• scientific article; zbMATH DE number 96386
• Some constructions on the class of groups of computable automorphisms

Cites work

• Algebraic structures computable without delay
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Fields of algebraic numbers computable in polynomial time. I
• Fields of algebraic numbers computable in polynomial time. II
• Finitely generated structures computable in polynomial time
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• Polynomial-time Abelian groups
• Polynomial-time versus recursive models
• Polynomially computable structures with finitely many generators
• Searching for applicable versions of computable structures
• Structures computable in polynomial time. I

Cited in

(4)

• Inversion operations in algebraic structures
• The existence of primitive recursive structures
• Description of structures computable in polynomial time
• Inversion in P-computable fields

This page was built for publication: The complexity of inversion in groups

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