Parallel modular computation of Gröbner and involutive bases
Denis A. Yanovich · Programming and Computer Software · 2013
An overview of an algorithm and an efficient implementation of parallel computing of involutive and Gröbner bases with the help of modular operations is presented. Difficulties arising in modulo calculations and in the reconstruction of a basis with coefficients in ℤ by its modular images are considered; Some ways to overcome these difficulties are indicated.