Irreducibility of multivariate polynomials
Journal of Computer and System Sciences
Fast parallel absolute irreducibility testing
Journal of Symbolic Computation
Factoring rational polynomials over the complexes
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Polynomial time algorithms for finding integer relations among real numbers
SIAM Journal on Computing
Absolute factorization of polynomials: a geometric approach
SIAM Journal on Computing
Factoring polynomials via relation-finding
ISTCS'92 Symposium proceedings on Theory of computing and systems
Effective Noether irreducibility forms and applications
Selected papers of the 23rd annual ACM symposium on Theory of computing
The singular value decomposition for polynomial systems
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Approximate polynomial greatest common divisors and nearest singular polynomials
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables
Proceedings of the 8th Colloquium on Automata, Languages and Programming
On square-free decomposition algorithms
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Efficient algorithms for computing the nearest polynomial with a real root and related problems
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Pseudofactors of multivariate polynomials
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Towards factoring bivariate approximate polynomials
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Semi-numerical determination of irreducible branches of a reduced space curve
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Approximate multivariate polynomial factorization based on zero-sum relations
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Irreducible decomposition of curves
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Linear differential operators for polynomial equations
Journal of Symbolic Computation
A geometric-numeric algorithm for absolute factorization of multivariate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Towards certified irreducibility testing of bivariate approximate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On approximate irreducibility of polynomials in several variables
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Approximate factorization of multivariate polynomials via differential equations
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Parametrization of approximate algebraic curves by lines
Theoretical Computer Science - Algebraic and numerical algorithm
Approximate bivariate factorization: a geometric viewpoint
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Approximate factorization of multivariate polynomials using singular value decomposition
Journal of Symbolic Computation
Extracting numerical factors of multivariate polynomials from taylor expansions
Proceedings of the 2009 conference on Symbolic numeric computation
Continuations and monodromy on random riemann surfaces
Proceedings of the 2009 conference on Symbolic numeric computation
Approximate factorization of polynomials over Z
Proceedings of the 2009 conference on Symbolic numeric computation
Computing monodromy via continuation methods on random Riemann surfaces
Theoretical Computer Science
| Hi-index | 0.00 |