How can a complex square root be computed in an optimal way?

DOI10.1007/BF01206319zbMath0851.68028OpenAlexW4235558922MaRDI QIDQ1918948

Kai Werther, Thomas Lickteig

Publication date: 17 November 1996

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01206319

zbMATH Keywords

straight-line programscomputation treeselementary geometric constructions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Nash functions and manifolds (14P20)

Related Items

Time-space tradeoffs in algebraic complexity theory

Cites Work

• Unnamed Item
• Unnamed Item
• Lectures on formally real fields
• Semi-algebraic decision complexity, the real spectrum, and degree
• The Computational Complexity of Division in Quadratic Extension Fields