×

Found 12 Documents (Results 1–12)

Newton’s method and the computational complexity of the fundamental theorem of algebra. (English) Zbl 1262.03129

Dilhage, R. (ed.) et al., Proceedings of the fourth international conference on computability and complexity in analysis (CCA 2007), Siena, Italy, June 16–18, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 202, 201-218 (2008).
MSC:  03F60 03D15
PDF BibTeX XML Cite
Full Text: DOI

Counting algebraic numbers with large height. I. (English) Zbl 1211.11115

Schlickewei, Hans Peter (ed.) et al., Diophantine approximation. Festschrift for Wolfgang Schmidt. Based on lectures given at a conference at the Erwin Schrödinger Institute, Vienna, Austria, 2003. Wien: Springer (ISBN 978-3-211-74279-2/hbk). Developments in Mathematics 16, 237-243 (2008).
MSC:  11R04 11G50
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Year of Publication

all top 3

Main Field

Software