Factoring polynomials via polytopes

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2004, Pages 4-11

  Salem, Fatima Abu ^a   Gao, Shuhong ^b   Lauder, Alan G B ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b CLEMSON UNIVERSITY   (United States)

Author keywords

Factorisation; Multivariate polynomial; Newton polytope

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; RANDOM PROCESSES;

FACTORIZATION; MULTIVARIATE POLYNOMIALS; NEWTON POLYTOPE;

POLYNOMIALS;

EID: 27644515566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. F. ABU SALEM, S. GAO, AND A.G.B. LAUDER "Factoring polynomials via polytopes: extended version", Report PRG-RR-04-07, Oxford University Computing Laboratory, 2004.
2. S. GAO, "Absolute irreducibility of polynomials via Newton polytopes," J. of Algebra 237 (2001), 501-520.
3. S. GAO AND A.G.B. LAUDER, "Decomposition of polytopes and polynomials", Discrete and Computational Geometry 26 (2001), 89-104.
4. S. GAO AND A.G.B. LAUDER, "Hensel lifting and bivariate polynomial factorisation over finite fields", Mathematics of Computation 71 (2002), 1663-1676.
5. S. GAO AND A.G.B. LAUDER, Fast absolute irreducibility testing via Newton polytopes, preprint 2003.
6. J. VON ZUR GATHEN AND J. GËRHARD, Modern Computer Algebra, Cambridge University Press, 1999.
7. J. VON ZUR GATHEN AND E. KALTOFEN, "Factoring sparse multivariate polynomials", J. of Comput. System Sci. 31 (1985), 265-287.
8. R. L. GRAHAM, "An efficient algorithm for determining the convex hull of a finite planar set", Inform. Process. Lett. 1 (1972), 132-3.
9. E. KALTOFEN AND B. TRAGER, "Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators", J. Symbolic Comput. 9 (1990), 301-320.
10. D. WAN, "Factoring polynomials over large finite fields", Math. Comp. 54 (1990), No. 190, 755-770.