On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An algorithm for solving parametric linear systems
Journal of Symbolic Computation
Complexity results for triangular sets
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Evaluation properties of invariant polynomials
Journal of Symbolic Computation
Some constructions for real algebraic curves
Journal of Symbolic Computation
On the computation of matrices of traces and radicals of ideals
Journal of Symbolic Computation
Root isolation of zero-dimensional polynomial systems with linear univariate representation
Journal of Symbolic Computation
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
| Hi-index | 0.00 |