Irreducibility of multivariate polynomials
Journal of Computer and System Sciences
Journal of Symbolic Computation - Special issue on computational algebraic complexity
A new polynomial factorization algorithm and its implementation
Journal of Symbolic Computation
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Subquadratic-time factoring of polynomials over finite fields
Mathematics of Computation
Modern computer algebra
Factoring a binary polynomial of degree over one million
ACM SIGSAM Bulletin
The complete analysis of a polynomial factorization algorithm over finite fields
Journal of Algorithms
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Hensel lifting and bivariate polynomial factorisation over finite fields
Mathematics of Computation
Yet another practical implementation of polynomial factorization over finite fields
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Newton's iteration and the sparse Hensel algorithm (Extended Abstract)
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Complexity issues in bivariate polynomial factorization
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
Proceedings of the 2005 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
Fast polynomial factorization and modular composition in small characteristic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Exact polynomial factorization by approximate high degree algebraic numbers
Proceedings of the 2009 conference on Symbolic numeric computation
On the relation between polynomial identity testing and finding variable disjoint factors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part I
Faster p-adic feasibility for certain multivariate sparse polynomials
Journal of Symbolic Computation
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
The problem of factoring a polynomial in a single or severalvariables over a finite field, the rational numbers or the complexnumbers is one of the success stories in the discipline of symboliccomputation. In the early 1960s implementors investigated theconstructive methods known from classical algebra books, but--withthe exception of Gauss's distinct degree factorizationalgorithm--found the algorithms quite inefficient in practice [16].The contributions in algorithmic techniques that have been madeover the next 40 years are truly a hallmark of symbolic computationresearch.The early pioneers, Berlekamp, Musser, Wang, Weinberger,Zassenhaus and others applied new ideas like randomization, thateven before the now famous algorithms for primality testing byRabin and Strassen, and like generic programming with coefficientdomains as abstract data classes, and they introduced the powerfulHensel lifting lemma to computer algebra. We note that whilede-randomization for integer primality testing has beenaccomplished recently [1], the same remains open for the problem ofcomputing a root of a polynomial modulo a large prime [12, ResearchProblem 14.48].Polynomial-time complexity for rational coefficients wasestablished in the early 1980s by the now-famous lattice basisreduction algorithm of A. Lenstra, H. W. Lenstra, Jr., and L.Lovász. The case of many variables first became anapplication of the DeMillo and Lipton/Schwartz/Zippel lemma [30]and then triggered a fundamental generalization from the standardsparse (distributed) representation of polynomials to the one bystraight line and black box programs [11, 17, 19]. Effectiveversions of the Hilbert irreducibility theorem are needed for theprobabilistic analysis, which serendipitously later have alsoplayed a role in the PCP characterization of NP[2]. Unlike many other problems in commutative algebra andalgebraic geometry, such as algebraic system solving, thepolynomial factoring problem is of probabilistic polynomial-timecomplexity in the number of variables.Complex coefficients in multivariate factors can be representedeither by exact algebraic numbers or by imprecise floating pointnumbers. The latter formulation is a cornerstone in the newcomputer algebra subject of SNAP (Symbolic-Numeric Algorthms forPolynomials) (see, e.g., [4]). The approaches for both exact andimprecise coefficients are manifold, including Ruppert's partialdifferential equations [26, 27, 6, 10] and Gao's and Lauder'sfar-reaching generalization of Eisenstein's criterion in themultivariate case to Newton polytope decomposition [8, 9]. Thecurrently best algorithms were all discovered recently within thepast ten years.The baby steps/giant steps technique and fast distinct and equaldegree factorization implementations have, at last, yielded in themid 1990s theoretical and practical improvements over the originalunivariate Berlekamp algorithm for coefficients in finite fields[13, 29, 18, 3]. The average time analysis for selected algorithmsis also completed [5]. For bivariate polynomials over finitefields, surprisingly Gröbner basis techniques are useful inpractice [23].New polynomial-time complexity results are the computation oflow degree factors of very high degree sparse (lacunary)polynomials by H. W. Lenstra, Jr. [20, 21], and the deterministicdistinct degree factorization for multivariate polynomials overlarge finite fields [7]. However, many problems with high degreepolynomials over large finite fields in sparse or straight lineprogram representations, such as computing a root modulo a largeprime, are not known to be in random polynomial time or NP-hard(cf. [24, 25, 15]).Finally, in 2000 Mark van Hoeij [14] reintroduced lattice basisreduction, now in the Berlekamp-Zassenhaus algorithm, to conquerthe hard-to-factor Swinnerton-Dyer polynomials in practice. Sasakiin 1993 had already hinted of the used approach [28].In my talk I will discuss a selection of the highlights, stateremaining open problems, and give some applications including anunusual one due to Moni Naor [22].