Towards Mixed Gröbner Basis Algorithms
Towards Mixed Gröbner Basis Algorithms
One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of unmixed polynomial systems, that is systems with polynomials having the same support, …