Fast numerical improvement of factors of polynomials and of partial fractions
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On the complexity of diophantine geometry in low dimensions (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Electronic Notes in Theoretical Computer Science (ENTCS)
IEEE Transactions on Signal Processing
Advice coins for classical and quantum computation
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Root finding with threshold circuits
Theoretical Computer Science
| Hi-index | 0.00 |