✦ LIBER ✦

Fast computation of Gröbner basis of homogenous ideals of( mathbb{F} )[x, y]

✍ Scribed by PeiZhong Lu; Yan Zou

Book ID: 107357305
Publisher: Science in China Press (SCP)
Year: 2008
Tongue: English
Weight: 439 KB
Volume: 51
Category: Article
ISSN: 1674-733X
DOI: 10.1007/s11432-008-0032-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing polynomial univariate represen

Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis

✍ XiaoDong Ma, Yao Sun, DingKang Wang 📂 Article 📅 2012 🏛 SP Science China Press 🌐 English ⚖ 234 KB

A new notion of reduction: Generating un

A new notion of reduction: Generating universal Gröbner bases of ideals in K[x, y]

✍ W. Herfort; H. Penz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 996 KB

In this paper a new notion of reduction depending on an arbitrary non-empty set ORD of term orderings on a polynomial ring is introduced. A general Buchberger algorithm based on this notion is devised. For a single element set ORD it specializes to the ordinary Buehberger algorithm. For ORD being th

An Algorithm for Computing a Gröbner Bas

An Algorithm for Computing a Gröbner Basis of a Polynomial Ideal over a Ring with Zero Divisors

✍ Deepak Kapur; Yongyang Cai 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 726 KB

The distribution of the zeros of the Gos

The distribution of the zeros of the Goss zeta-function for(A=mathbb{F },!{}_2[x,y]/(y^2+y+x^3+x+1))

✍ Gebhard Böckle 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 French ⚖ 392 KB

A fast algorithm for finding small solut

A fast algorithm for finding small solutions of F(X,Y)=G(X,Y) over number fields

✍ István Gaál 📂 Article 📅 2005 🏛 Akadmiai Kiad 🌐 English ⚖ 224 KB

A fast algorithm for finding "small" sol

A fast algorithm for finding "small" solutions of F(x,y)=G(x,y) over imaginary quadratic fields

✍ István Gaál 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 186 KB