The complexity of inversion in groups

DOI10.1007/s10469-024-09730-9OpenAlexW4391783264MaRDI QIDQ6199353

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 groupprimitive recursive functioninversion operationsquotient structure

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic structures computable without delay
• Fields of algebraic numbers computable in polynomial time. I
• Polynomial-time versus recursive models
• Polynomial-time Abelian groups
• Finitely generated structures computable in polynomial time
• Searching for applicable versions of computable structures
• Fields of algebraic numbers computable in polynomial time. II
• Polynomially computable structures with finitely many generators
• Structures computable in polynomial time. I
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

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