@incollection{AST_1990__192__17_0, author = {Roy, Marie-Fran\c{c}oise}, title = {Computation of the topology of a real curve}, booktitle = {Algorithmique, topologie et g\'eom\'etrie alg\'ebriques - S\'evilla,1987, Toulouse 1988}, editor = {Hayat-Legrand Claude and Sergeraert Francis}, series = {Ast\'erisque}, pages = {17--33}, publisher = {Soci\'et\'e math\'ematique de France}, number = {192}, year = {1990}, language = {en}, url = {http://archive.numdam.org/item/AST_1990__192__17_0/} }
TY - CHAP AU - Roy, Marie-Françoise TI - Computation of the topology of a real curve BT - Algorithmique, topologie et géométrie algébriques - Sévilla,1987, Toulouse 1988 AU - Collectif ED - Hayat-Legrand Claude ED - Sergeraert Francis T3 - Astérisque PY - 1990 SP - 17 EP - 33 IS - 192 PB - Société mathématique de France UR - http://archive.numdam.org/item/AST_1990__192__17_0/ LA - en ID - AST_1990__192__17_0 ER -
%0 Book Section %A Roy, Marie-Françoise %T Computation of the topology of a real curve %B Algorithmique, topologie et géométrie algébriques - Sévilla,1987, Toulouse 1988 %A Collectif %E Hayat-Legrand Claude %E Sergeraert Francis %S Astérisque %D 1990 %P 17-33 %N 192 %I Société mathématique de France %U http://archive.numdam.org/item/AST_1990__192__17_0/ %G en %F AST_1990__192__17_0
Roy, Marie-Françoise. Computation of the topology of a real curve, in Algorithmique, topologie et géométrie algébriques - Sévilla,1987, Toulouse 1988, Astérisque, no. 192 (1990), pp. 17-33. http://archive.numdam.org/item/AST_1990__192__17_0/
[AM] A polynomial-time algorithm for the topological type of a real algebraic curve. J. of Symbolic Computation 5 213-236 (1988).
, :[BKR] The complexity of elementary algebra and geometry. J. of Computation and Systems Sciences 32 251-264 (1986).
, , :[BCR] Géométrie algébrique réelle. Ergebnisse der Mathematik, vol. 12. Berlin Heidelberg New York: Springer Verlag (1987).
, , :[Ca] Some algebraic and geometric computations in . ACM Symposium on the theory of computation, 460-467 (1988).
:[C] Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Second GI Conference on Automata Theory and Formal Languages. Lecture Notes in Computer Sciences, vol. 33, pp. 134-183, Springer-Verlag, Berlin.
:[Co] Effective semi-algebraic geometry. Springer Lecture Notes in Computer Science 391 1-27 (1989).
:[CoR] Thom's lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets. J. of Symbolic Computation 5 121-130 (1988).
, :[CuGR] On algorithms for real algebraic curves. To appear in the Proceedings of MEGA 1990.
, , :[Cu P3R] Computation of the real analytic components of a real algebraic curve. Conférence A.A.E.C.C.-5, Minorca. Springer Lecture Notes in Computer Science 356 (1989).
, , , , :[DD] Algebraic computaion on algebraic numbers. Informatique et calcul. Wiley-Masson (1985).
, :[GT] Shape determination of real curves and surfaces. Ann. Univ. Ferrara Sez VII Sec. Math. vol XXIX 87-109 (1983).
, :[G] La sucesion de Sturm-Habicht y sus aplicaciones al algebra computatcional. Thèse (University of Santander, 1989).
:[GLRR 1] Spécialisation de la suite de Sturm et sous-résultants. I et II (to appear in RAIRO d'Informatique théorique).
, , , :[GLRR 2] Sturm-Habicht sequences, 136-145, ISSAC'89 Portland, ACM Press.
, , , :[Gr] Complexity of deciding Tarski algebra. J. of Symbolic Computation 5 65-108 (1988).
:[GrV] Solving systems of polynomial inequalities in subexponential time. J. of Symbolic Computation 5 37-66 (1988).
:[HRS 1] Complexité du principe de Tarski-Seidenberg C.R. Acad. Sci. Paris 309 825-830 (1989).
, , :[HRS 2] Complexity of semi algebraic sets. 293-298 IFIP'89 San Francisco, North-Holand (1989).
, , :[HRS 3] Sur la complexité du principe de Tarski-Seidenberg (submitted to the Bulletin de la SMF).
, , :[Re 1] A faster algorithm for deciding the existential theory of the reals. Technical Report 792, Cornell University Ithaca (1988).
:[Re 2] On the computational complexity and geometry of the first order theory of the reals. Technical Report 856, Cornell University Ithaca (1989).
:[RS 1] Complexity of the computations on real algebraic numbers (to appear in the Journal of Symbolic Computation).
, :[RS 2] Complexity of the computation of cylindrical decomposition and topology of real algebraic curve using Thom's lemma. Géométrie Algébrique et Analytique Réelle Trento 1988. Springer Lecture Notes in Mathematics 1420 223-236 (1990).
, :[SS] On the "Piano movers" problem. II. Advances in applied mathematics 4 298-351 (1983).
, :