Skip to main content
SpringerLink
Log in

Greater easy common divisor and standard basis completion algorithms

  • Gröbner Bases
  • Conference paper
  • First Online:
Symbolic and Algebraic Computation (ISSAC 1988)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bayer, D. A., The division algorithm and the Hilbert scheme, Ph.D. thesis, Harvard (1982).

    Google Scholar 

  2. Bayer, D. A., Stillman, M., A theorem on refining division orders by the reverse lexicographic order, Duke Math. J. 55 (1987;), 1–11.

    Google Scholar 

  3. Buchberger, B., Collins, G. E., Loos, R., “Computer Algebra,” Springer Verlag, Wien-New York, 1982.

    Google Scholar 

  4. Buchberger, B., An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal, Aequationes Mathematicae 4 (1970), 374–383. (Ph.D. Thesis, Math. Inst. Univ. Innsbruck, 1965).

    Google Scholar 

  5. —, A Criterion for Detecting Unnecessary Reductions in the Construction of Gröbner Bases, in “EUROSAM 1979,” Lecture Notes in Computer Science 72, Springer Verlag, Berlin-Heidelberg-New York, 1979, pp. 3–21.

    Google Scholar 

  6. Galligo, A., Algorithmes de calcul de base standard, Université de Nice (preprint) (1982).

    Google Scholar 

  7. Galligo, A., Traverso, C., Pottier,L., Appendix to: Greater Easy Common Divisor and standard basis completion algorithms, Rapports de Recherche (1988), INRIA, centre de Sophia Antipolis.

    Google Scholar 

  8. Gebauer, R., Möller, H. M., An installation of of Buchberger's algorithm, J. of Symbolic Computation (to appear).

    Google Scholar 

  9. Loos, R., Generalized polynomial remainder sequences, in “Computer Algebra,” (BCL), pp. 115–137.

    Google Scholar 

  10. Pottier, L., Algorithmes de completion, constructions, preuves, stratégies, applications. (to appear); (submitted to “1988 IEEE Symposium on Logic in;Computer Science”)

    Google Scholar 

  11. Traverso, C., Gröbner trace algorithms, (these proceedings).

    Google Scholar 

  12. —, AIPi: a package to test different versions of the Gröbner basis completion algorithm. (to appear)

    Google Scholar 

  13. van der Waerden, B. L., “Moderne Algebra,” Springer Verlag, Berlin-Heidelberg-New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Départment de Mathématiques, Université de Nice et INRIA, Parc Valrose, F-06034, NICE CEDEX

    André Galligo & Loïc Pottier

  2. Dipartimento di Matematica, Università di Pisa, Via F.Buonarroti 2, I-56100, PISA

    Carlo Traverso

Authors
  1. André Galligo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Loïc Pottier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carlo Traverso
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Gianni

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Galligo, A., Pottier, L., Traverso, C. (1989). Greater easy common divisor and standard basis completion algorithms. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-51084-2_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51084-0

  • Online ISBN: 978-3-540-46153-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation