The Computational Complexity of Division in Quadratic Extension Fields

DOI10.1137/0216023zbMath0686.68040OpenAlexW1967306952MaRDI QIDQ4205081

Thomas Lickteig

Publication date: 1987

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0216023

zbMATH Keywords

computational complexityalgebraic computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (2)

On the number of multiplications needed to invert a monic power series over fields of characteristic two ⋮ How can a complex square root be computed in an optimal way?

This page was built for publication: The Computational Complexity of Division in Quadratic Extension Fields