An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Exponential space computation of Gröbner bases
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Efficient Groebner walk conversion for implicitization of geometric objects
Computer Aided Geometric Design
An algorithm for the computation of the radical of an ideal
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A new class of term orders for elimination
Journal of Symbolic Computation
Efficient Groebner walk conversion for implicitization of geometric objects
Computer Aided Geometric Design
Degree bounds for Gröbner bases of low-dimensional polynomial ideals
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Space-efficient Gröbner basis computation without degree bounds
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Computing a structured Gröbner basis approximately
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Dimension-dependent bounds for Gröbner bases of polynomial ideals
Journal of Symbolic Computation
Hi-index | 0.00 |