Complexity of computation on real algebraic numbers
From MaRDI portal
(Redirected from Publication:757065)
Recommendations
Cites work
- scientific article; zbMATH DE number 4142180 (Why is no real title available?)
- scientific article; zbMATH DE number 3922806 (Why is no real title available?)
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 3785018 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3445421 (Why is no real title available?)
- scientific article; zbMATH DE number 3307642 (Why is no real title available?)
- The complexity of elementary algebra and geometry
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
Cited in
(34)- Dynamic evaluation and real closure.
- A theorem on random polynomials and some consequences in average complexity
- 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
- scientific article; zbMATH DE number 4132288 (Why is no real title available?)
- NC algorithms for real algebraic numbers
- Algebraic certificates for Budan's theorem
- Determinantal formulae for the solution set of zero-dimensional ideals
- scientific article; zbMATH DE number 2151239 (Why is no real title available?)
- 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
- Computation of algebraic numbers and arithmetic operations over them with linear memory
- scientific article; zbMATH DE number 66626 (Why is no real title available?)
- Linear solving for sign determination
- Codes and adjustment in digraphs of root simplexes of real polynomials
- Algorithms – ESA 2004
- 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
- On Newton's rule and Sylvester's theorems
- Sensing as a complexity measure
- 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)
