Factoring polynomials via polytopes

Authors:
Fatima Abu Salem;Shuhong Gao;Alan G. B. Lauder
Affiliations:
Oxford University, Oxford, UK;Clemson University, Clemson, South Carolina;Oxford University, Oxford, UK
Venue:
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Year:
2004

Citing 4
Cited 8

Factoring sparse multivariate polynomials

Journal of Computer and System Sciences
Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Modern computer algebra

Modern computer algebra
Hensel lifting and bivariate polynomial factorisation over finite fields

Mathematics of Computation

Lifting and recombination techniques for absolute factorization

Journal of Complexity
An efficient sparse adaptation of the polytope method over Fp and a record-high binary bivariate factorisation

Journal of Symbolic Computation
Parallel methods for absolute irreducibility testing

The Journal of Supercomputing
Dynamic balancing of planar mechanisms using toric geometry

Journal of Symbolic Computation
Towards toric absolute factorization

Journal of Symbolic Computation
A lifting and recombination algorithm for rational factorization of sparse polynomials

Journal of Complexity
Ruppert matrix as subresultant mapping

CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
An efficient algorithm to factorize sparse bivariate polynomials over the rationals

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to present an algorithm for factoring bivariate polynomials which is able to exploit to some extent the sparsity of polynomials. We give details of an implementation which we used to factor randomly chosen sparse and composite polynomials of high degree over the binary field.