Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
On local implicit approximation and its applications
ACM Transactions on Graphics (TOG) - Special issue on computer-aided design
Geometric computations with algebraic varieties of bounded degree
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
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
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
Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
Journal of Symbolic Computation
The multivariate resultant is NP-hard in any characteristic
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |