Sparse FGLM algorithms

Given a zero-dimensional ideal I⊂K[x1,…,xn] of degree D, the transformation of the ordering of its Gröbner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving process. Thus it is of crucial importance to design efficient algorithms...

Ausführliche Beschreibung