A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
DOI10.1137/0218013zbMath0678.68028OpenAlexW2012846413MaRDI QIDQ3835017
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218013
substitution methodadjunction of intermediate results to the groundfield and approximative complexityarithmetic in finite extension fieldsOstrowski complexity
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algebraic field extensions (12F05) Quadratic algebras (but not quadratic Jordan algebras) (17A45)
This page was built for publication: A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
