An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.28, Iss.3, 1999-09, pp. : 317-338

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

A Fast Algorithm for Gröbner Basis Conversion and its Applications

By Tran Q-N.

Journal of Symbolic Computation, Vol. 30, Iss. 4, 2000-10 ,pp. : 451-467

Academic Press

Access to resources Recommend Favorite

Cellular Binomial Ideals. Primary Decomposition of Binomial Ideals

By MartÍnez de Castilla I.O. Sánchez R.P.

Journal of Symbolic Computation, Vol. 30, Iss. 4, 2000-10 ,pp. : 383-400

Academic Press

Access to resources Recommend Favorite

A fast algorithm for constructing nearly optimal prefix codes

SOFTWARE:PRACTICE AND EXPERIENCE, Vol. 46, Iss. 10, 2016-10 ,pp. : 1299-1316

John Wiley & Sons Inc

Access to resources Recommend Favorite

Generation of difference schemes for the burgers equation by constructing Gröbner bases

By Blinkov Yu. Mozzhilkin V.

Programming and Computer Software, Vol. 32, Iss. 2, 2006-03 ,pp. : 114-117

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Determining of Level Sets for a Fuzzy Surface Using Gröbner Basis

International Journal of Fuzzy System Applications (IJFSA), Vol. 4, Iss. 2, 2015-04 ,pp. : 1-14

IGI Global_journal

Access to resources Recommend Favorite