Algorithms for sparse polynomial systems : Gröbner bases and resultants
Algorithms for sparse polynomial systems : Gröbner bases and resultants
Solving polynomial systems is one of the oldest and most important problems in computational mathematics and has many applications in several domains of science and engineering. It is an intrinsically hard problem with complexity at least single exponential in the number of variables. However, in most of the cases, the …