On the complexity of algebraic power series
Part of the Lecture Notes in Computer Science book series (LNCS, volume 508)
Submitted Contributions Computational Algebra And Geometry
- 160 Downloads
KeywordsLocal Ring Algebraic Function Irreducible Polynomial Irreducible Factor Zariski Closure
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [AMR]M.E.Alonso, T.Mora, M.Raimondo. A computational model for algebraic power series. J. Pure and Appl. Algebra, to appear.Google Scholar
- [B-R]R. Benedetti, J.J. Risler. Real Algebraic and Semialgebraic sets. Hermann, Paris 1990.Google Scholar
- [H]J.Heintz. Definability and fast quantifier elimination in algebraically closed fields. Theoretical Computer Science 24 (1983).Google Scholar
- [K-T]H.T.Kung, J.F.Traub. All Algebraic Functions can Be Computed Fast. J. ACM 25 (1978).Google Scholar
- [R1]R.Ramanakoraisina. Complexité des fonctions de Nash. Comm. Algebra 17 (1989).Google Scholar
- [R2]R.Ramanakoraisina. Bézout Theorem for Nash functions. Preprint U.E.R. Math.Univ. Rennes (1989).Google Scholar
- [Z-S]O.Zariski, P.Samuel. Commutative Algebra Vol II. Van Nostrand 1960.Google Scholar
© Springer-Verlag Berlin Heidelberg 1991