Complexity of computation on real algebraic numbers

DOI10.1016/S0747-7171(08)80035-1zbMATH Open0723.68054OpenAlexW2016506651MaRDI QIDQ757065FDOQ757065

Authors: Aviva Szpirglas, Marie-Françoise Roy 

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80035-1

Recommendations

• NC algorithms for real algebraic numbers
• Fields of algebraic numbers computable in polynomial time. I
• scientific article; zbMATH DE number 953041
• scientific article; zbMATH DE number 1023365
• Real Algebraic Numbers: Complexity Analysis and Experimentation

zbMATH Keywords

real algebraic numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algebraic numbers; rings of algebraic integers (11R04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• Title not available (Why is that?)
• The complexity of elementary algebra and geometry
• Title not available (Why is that?)

Cited In (34)

• A theorem on random polynomials and some consequences in average complexity
• Dynamic evaluation and real closure.
• Zero-nonzero and real-nonreal sign determination
• On the complexity of conversion between classic real number representations
• A new graph characteristic and its application to numerical computability
• Does computer algebra help at all learning about real numbers?
• Bit complexity for computing one point in each connected component of a smooth real algebraic set
• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• Polynomial-time presentations of algebraic number fields
• Title not available (Why is that?)
• Algebraic certificates for Budan's theorem
• NC algorithms for real algebraic numbers
• Title not available (Why is that?)
• Determinantal formulae for the solution set of zero-dimensional ideals
• Polar varieties, real equation solving, and data structures: the hypersurface case
• On the complexity of computing the logarithm and square root functions on a complex domain
• Title not available (Why is that?)
• Computation of algebraic numbers and arithmetic operations over them with linear memory
• Codes and adjustment in digraphs of root simplexes of real polynomials
• Algorithms – ESA 2004
• Linear solving for sign determination
• An exact real algebraic arithmetic with equality determination
• Effective asymptotics of linear recurrences with rational coefficients
• Towards faster real algebraic numbers
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• On the complexity of quadratic programming in real number models of computation
• On the complexity of algebraic numbers
• Sensing as a complexity measure
• On Newton's rule and Sylvester's theorems
• Generic computation of the real closure of an ordered field.
• Computing bits of algebraic numbers
• Intrinsic complexity estimates in polynomial optimization
• Topics in real and complex number complexity theory
• Stability versus speed in a computable algebraic model

This page was built for publication: Complexity of computation on real algebraic numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757065)