A polynomial factorization challenge
ACM SIGSAM Bulletin
Arithmetic and factorization of polynomial over F2 (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Reconstructing randomly sampled multivariate polynomials from highly noisy data
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Factorization in Z[x]: the searching phase
ISSAC '00 Proceedings of the 2000 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
List Decoding: Algorithms and Applications
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Polynomial factorization over F2
Mathematics of Computation
A geometric-numeric algorithm for absolute factorization of multivariate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Yet another practical implementation of polynomial factorization over finite fields
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
Absolute polynomial factorization in two variables and the knapsack problem
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
IEEE Transactions on Computers
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
Lifting and recombination techniques for absolute factorization
Journal of Complexity
Approximate bivariate factorization: a geometric viewpoint
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Exact polynomial factorization by approximate high degree algebraic numbers
Proceedings of the 2009 conference on Symbolic numeric computation
Extracting numerical factors of multivariate polynomials from taylor expansions
Proceedings of the 2009 conference on Symbolic numeric computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Modular Las Vegas algorithms for polynomial absolute factorization
Journal of Symbolic Computation
A note on Gao's algorithm for polynomial factorization
Theoretical Computer Science
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |