论文信息 - Effective computation of strong Gröbner bases over Euclidean domains - 字舞流文

Effective computation of strong Gröbner bases over Euclidean domains

Daniel Lichtblau | Daniel Lichtblau

[1] L. O'carroll. AN INTRODUCTION TO GRÖBNER BASES (Graduate Studies in Mathematics 3) , 1996 .

[2] Daniel Lichtblau,et al. Applications of strong Grobner bases over Euclidean domains , 2013 .

[3] W. W. Adams,et al. An Introduction to Gröbner Bases , 2012 .

[4] Graham H. Norton,et al. Strong Gröbner bases and cyclic codes over a finite-chain ring , 2001, Electron. Notes Discret. Math..

[5] Michael Kalkbrener,et al. Converting Bases with the Gröbner Walk , 1997, J. Symb. Comput..

[6] H. Michael Möller,et al. On the Construction of Gröbner Bases Using Syzygies , 1988, J. Symb. Comput..

[7] Deepak Kapur,et al. Computing a Gröbner Basis of a Polynomial Ideal over a Euclidean Domain , 1988, J. Symb. Comput..

[8] Donal O'Shea,et al. Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) , 1997, Undergraduate texts in mathematics.

[9] Luquan Pan,et al. On the D-Bases of Polynomial Ideals Over Principal Ideal Domains , 1989, J. Symb. Comput..

[10] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .