Advertisement

A note on the complexity of constructing standard bases

  • Marc Giusti
Algebraic Algorithms V
Part of the Lecture Notes in Computer Science book series (LNCS, volume 204)

References

  1. [B]
    B. BUCHBERGER: A note on the complexity of constructing Gröbner bases, Proceedings EUROCAL 83 (London), Lecture Notes in Computer Science 162 (1983), 137–145.Google Scholar
  2. [G]
    M. GIUSTI: Some effectivity problems in polynomial ideal theory, Proceedings EUROSAM 84 (Cambridge), Lecture Notes in Computer Science 174 (1984), 159–171.Google Scholar
  3. [L]
    D. LAZARD: Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, EUROCAL 83 (London), Lecture Notes in Computer Science 162 (1983), 146–156.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Marc Giusti
    • 1
  1. 1.Centre de Mathématiques Ecole PolytechniquePalaiseau CedexFrance

Personalised recommendations