Inversion operations in algebraic structures

DOI10.3233/COM-230459MaRDI QIDQ6146820zbMATH OpenOpenAlexFDO

Authors P. E. Alaev

Publication date 31 January 2024

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-230459

zbMATH Keywords

algebraic classescomplexity of computationscomputabilityinversion operationpolynomial computability

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Recommendations

• The complexity of inversion in groups
• A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
• Inversion in finite fields using logarithmic depth
• Linear complexity inversion algorithms for a class of structured matrices
• On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime

Cites work

• Algebraic structures computable without delay
• Fields of algebraic numbers computable in polynomial time. II
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3307642 (Why is no real title available?)
• scientific article; zbMATH DE number 3349977 (Why is no real title available?)
• Polynomial-time versus recursive models
• Quotient structures and groups computable in polynomial time
• Searching for applicable versions of computable structures

Cited in

(3)

• The complexity of inversion in groups
• The existence of primitive recursive structures
• Inversion in P-computable fields

This page was built for publication: Inversion operations in algebraic structures

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