Parallel methods for absolute irreducibility testing

DOI10.1007/s11227-008-0205-1zbMath1187.65049MaRDI QIDQ1009361

Laurence Tianruo Yang, Fatima K. Abu Salem

Publication date: 31 March 2009

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11227-008-0205-1

zbMATH Keywords

Parallel algorithms; Newton polytopes; Absolute irreducibility; Bivariate polynomials; Bulk synchronous model; Multivariate polynomials

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

65Y05: Parallel numerical computation

65H04: Numerical computation of roots of polynomial equations

Uses Software

• BSPlib
• BSPedupack

Cites Work

• Algebraic function fields and codes
• Factoring multivariate polynomials over finite fields
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
• Über ein euklidisch-geometrisches Problem von B. Grünbaum
• Absolute Factorization of Polynomials: A Geometric Approach
• Factorization of Multivariate Polynomials Over Finite Fields
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Factoring polynomials via polytopes
• Factoring multivariate polynomials via partial differential equations
• Absolute irreducibility of polynomials via Newton polytopes
• Decomposition of polytopes and polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item