Fast algorithms for the characteristic polynomial
Theoretical Computer Science
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering
Journal of Symbolic Computation
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Hi-index | 0.00 |