Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. M. Ben-Or, D. Kozen, J. Reif, The complexity of elementary algebra and geometry, J. of Computer and Systems Sciences, 18:251–264, (1986).
2. M. Coste, M.-F. Roy, Thom’s lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets. Journal of Symbolic Computation 5, No.1/2, 121–129 (1988).
3. A. Eigenwillig, V. Sharma, C. Yap, Almost tight complexity bounds for Descartes method, preprint (2006).
4. G. Farin, Curves and surfaces for Computer Aided Design, Academic Press (1990).
5. J.-M. Lane, R. F. Riesenfeld, Bounds on a polynomial, 21 112–117 (1981).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing the Density of the Positivity Set for Linear Recurrence Sequences;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02