Parallel computation of Janet and Gröbner bases over rational numbers

ISSN： 0361-7688

Source： Programming and Computer Software, Vol.31, Iss.2, 2005-03, pp. : 73-80

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On selection of nonmultiplicative prolongations in computation of Janet bases

By Gerdt V. Blinkov Yu.

Programming and Computer Software, Vol. 33, Iss. 3, 2007-05 ,pp. : 147-153

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Effectiveness of involutive criteria in computation of polynomial Janet bases

By Gerdt V. Yanovich D.

Programming and Computer Software, Vol. 32, Iss. 3, 2006-05 ,pp. : 134-138

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Gröbner Bases over Galois Rings with an Application to Decoding Alternant Codes

By Byrne E. Fitzpatrick P.

Journal of Symbolic Computation, Vol. 31, Iss. 5, 2001-05 ,pp. : 565-584

Academic Press

Access to resources Recommend Favorite

On the Complexity of Gröbner Bases Conversion

By Kalkbrener M.

Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. : 265-273

Academic Press

Access to resources Recommend Favorite

Counting and Gröbner Bases

By Kalorkoti K.

Journal of Symbolic Computation, Vol. 31, Iss. 3, 2001-03 ,pp. : 307-313

Academic Press

Access to resources Recommend Favorite