- 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. Copyright 2004 ACM.
- Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC
- Publication date:
- Source identifiers:
- Local pid:
- Copyright date:
Factoring polynomials via polytopes
If you are the owner of this record, you can report an update to it here: Report update to this record