NC algorithms for real algebraic numbers

DOI10.1007/BF01387193zbMath0786.12007DBLPjournals/aaecc/CuckerLMPR92OpenAlexW2048810447WikidataQ57733312 ScholiaQ57733312MaRDI QIDQ1201334

S. Singh

Publication date: 17 January 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

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

zbMATH Keywords

real algebraic numbersThom's lemmamultivariate Sturm theoryNC complexityparallel algebraic complexity

Mathematics Subject Classification ID

Related Items (2)

On the complexity of quadratic programming in real number models of computation ⋮ Intrinsic complexity estimates in polynomial optimization

Cites Work

• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• Complexity of computation on real algebraic numbers
• On computing the determinant in small parallel time using a small number of processors
• Matrix multiplication via arithmetic progressions
• The complexity of elementary algebra and geometry
• A theorem on random polynomials and some consequences in average complexity
• Spécialisation de la suite de Sturm et sous-résultants (I)
• Fast parallel matrix and GCD computations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: NC algorithms for real algebraic numbers