NC algorithms for real algebraic numbers
From MaRDI portal
Publication:1201334
DOI10.1007/BF01387193zbMath0786.12007WikidataQ57733312 ScholiaQ57733312MaRDI QIDQ1201334
Publication date: 17 January 1993
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
real algebraic numbers; Thom's lemma; multivariate Sturm theory; NC complexity; parallel algebraic complexity
DB lookup for MSC labels failed
Related Items
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