Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
A new algorithm for discussing Gröbner bases with parameters
Journal of Symbolic Computation
Derivations and radicals of polynomial ideals over fields of arbitrary characteristic
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Computer algebra handbook
A speed-up of the algorithm for computing comprehensive Gröbner systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On the decoding of binary cyclic codes with the Newton identities
Journal of Symbolic Computation
Gröbner bases for polynomial systems with parameters
Journal of Symbolic Computation
An algebraic implicitization and specialization of minimum KL-divergence models
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Hilbert stratification and parametric gröbner bases
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Speeding up cylindrical algebraic decomposition by gröbner bases
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Stability conditions of monomial bases and comprehensive gröbner systems
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case
Theoretical Computer Science
On the structure of lexicographic Gröbner bases in dimension zero
ACM Communications in Computer Algebra
| Hi-index | 0.00 |