How can a complex square root be computed in an optimal way?
type: Item
instance of: scholarly article
title: How can a complex square root be computed in an optimal way?
zbMATH Open document ID: 0851.68028
DOI: 10.1007/BF01206319
author: Thomas Lickteig
author: Kai Werther
published in: Computational Complexity
publication date: 1996-11-17T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 14P10
Mathematics Subject Classification ID: 14P20
zbMATH DE Number: 907997
zbMATH Keywords: computation trees
zbMATH Keywords: straight-line programs
zbMATH Keywords: elementary geometric constructions
MaRDI profile type: Publication
cites work: The Computational Complexity of Division in Quadratic Extension Fields
cites work: Semi-algebraic decision complexity, the real spectrum, and degree
cites work: Q3739243
cites work: Lectures on formally real fields
cites work: Q4306894
full work available at URL: https://doi.org/10.1007/bf01206319
OpenAlex ID: W4235558922
description: scientific article; zbMATH DE number 907997