Skip to main content

Complexity of standard bases in projective dimension zero

  • Polynomial Algorithms
  • Conference paper
  • First Online:
Eurocal '87 (EUROCAL 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 378))

Included in the following conference series:

bitnet : cfmagi@frpoly11 uucp : ... mcvax!inria!cmep!giusti

Unité associée au CNRS No. 169 and GRECO de Calcul Formel No. 60 (partially supported by a grant from PRC “Mathématiques et Informatique”)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. M. GIUSTI, Théorie combinatoire de la dimension d'une variété algébrique, Notes informelles de Calcul Formel VI, prépublication du Centre de Mathématiques de l'Ecole Polytechnique (1985), and Compt. Rend. du Colloque Algèbre et Algèbre effective de Rennes (1985). Augmented english version to be published in J. Symbolic Computation (1988).

    Google Scholar 

  2. D. LAZARD, Résolution des systèmes d'équations algébriques, Theoretical Computer Science 15 (1981), 77–110.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giusti, M. (1989). Complexity of standard bases in projective dimension zero. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_136

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_136

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

  • Online ISBN: 978-3-540-48207-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics