A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
From MaRDI portal
Publication:3835017
Recommendations
- The Computational Complexity of Division in Quadratic Extension Fields
- The equivariant complexity of multiplication in finite field extensions
- STACS 2005
- A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
- Semi-algebraic complexity of quotients and sign determination of remainders
- Finite-Dimensional Division Algebras over Fields
- Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of F_q
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- On the bounds of the bilinear complexity of multiplication in some finite fields
- On upper bound of the complexity of quasi polynomial representations of functions over finite fields
Cited in
(4)
This page was built for publication: A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835017)