Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 1991: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp 130–139Cite as

Buchberger algorithm and integer programming

  • Submitted Contributions
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Buchberger, Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory, Multidimensional Systems Theory, (ed N.K. Bose), D. Reidel Publ. Comp., pp. 184–232.

    Google Scholar 

  2. P. Conti, Basi di Gröbner e sistemi lineari diofantei, Tech. Rep. Dip. Mat. Univ. Pisa, (1990).

    Google Scholar 

  3. P. Conti, C. Traverso, Computing the conductor of an integral extension, (AAECC-6), Discr. Appl. Math.

    Google Scholar 

  4. A. Giovini, T. Mora, G. Niesi, L. Robbiano, C. Traverso, “One sugar cube, please” OR Selection strategies in Buchberger algorithm, ISSAC-91, ACM.

    Google Scholar 

  5. F. Ollivier, Canonical Bases: Relations with Standard Bases, Finiteness Conditions and Application to Tame Automorphisms, Mega-90, proceedings, Progress in Mathemathics, Birkhauser, 1991, pp. 379–400.

    Google Scholar 

  6. L. Pottier, Minimal solutions of linear diphantine systems: bounds and algorithms, Proceedings RTA '91, Como, LNCS 488, Springer Verlag.

    Google Scholar 

  7. L. Robbiano, Term orderings on the polynomyal ring., EUROCAL 85, proceedings, Springer Lec. Notes Comp. Sci. 204, pp. 513–517.

    Google Scholar 

  8. D. Spear, A constructive approach to commutative ring theory, Proc. 1977 Macsyma User's conference, 1977, pp. 369–376.

    Google Scholar 

  9. D. Shannon and M. Sweedler, Using Groebner bases to determine algebra membership, split surjective algebra homomorphisms and determine birational equivalence, J. Symb. Comp. 6 (1988), 267–273.

    Google Scholar 

  10. C. Traverso, L. Donati, Experimenting the Gröbner basis alghorithm with the AlPI system, IS-SAC-89, A.C.M..

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Matematica Applicata — Dipartimento di Matematica, Università di Pisa, Italy

    Pasqualina Conti & Carlo Traverso

Authors
  1. Pasqualina Conti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlo Traverso
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Harold F. Mattson Teo Mora T. R. N. Rao

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Conti, P., Traverso, C. (1991). Buchberger algorithm and integer programming. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1991. Lecture Notes in Computer Science, vol 539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54522-0_102

Download citation

  • DOI: https://doi.org/10.1007/3-540-54522-0_102

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54522-4

  • Online ISBN: 978-3-540-38436-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation