Factoring polynomials over global fields
Number Theory
2007-05-23 v1
Abstract
Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.
Cite
@article{arxiv.math/0409510,
title = {Factoring polynomials over global fields},
author = {K. Belabas and M. van Hoeij and J. Klueners and A. Steel},
journal= {arXiv preprint arXiv:math/0409510},
year = {2007}
}
Comments
10 pages
Related papers
View all related →
Number Theory · Mathematics
Factoring polynomials over function fields
Jose Felipe Voloch
2024-09-16
Number Theory · Mathematics
Factorising Polynomials over Finite Fields
Amalaswintha Wolfsdorf
2017-09-19
Symbolic Computation · Computer Science
An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field
Yao Sun, Dingkang Wang
2010-10-04
Number Theory · Mathematics
Square-free OM computation of global integral bases
Jordi Guàrdia, Enric Nart
2022-03-04
Number Theory · Mathematics
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach
Zeyu Guo
2020-08-05
Rings and Algebras · Mathematics
Splitting full matrix algebras over algebraic number fields
Gábor Ivanyos, Lajos Rónyai, Josef Schicho
2011-12-22
Number Theory · Mathematics
Factoring bivariate sparse (lacunary) polynomials
Martin Avendano, Teresa Krick, Martin Sombra
2007-05-23
Symbolic Computation · Computer Science
Computing sparse multiples of polynomials
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
2011-01-04
Number Theory · Mathematics
Genus computation of global function fields
Jens-Dietrich Bauch
2012-09-27
Commutative Algebra · Mathematics
Polynomial factorization over henselian fields
Maria Alberich-Carramiñana, Jordi Guàrdia, Enric Nart, Adrien Poteaux +2
2022-07-06
Number Theory · Mathematics
Deterministic polynomial factorisation modulo many primes
Daniel Altman
2025-09-17
Data Structures and Algorithms · Computer Science
Factoring Polynomials over Finite Fields using Balance Test
Chandan Saha
2008-02-21
General Mathematics · Mathematics
Factorization of Polynomials over the Field of Rational Numbers
Duggirala Meher Krishna, Duggirala Ravi
2019-12-30
Rings and Algebras · Mathematics
An algorithm for factoring non-monic quadratic polynomials Or: How I learned to stop using the quadratic formula and love undoing FOIL
Corey Thomas Bruns
2009-12-08
Symbolic Computation · Computer Science
Computing the fixing group of a rational function
Jaime Gutierrez, Rosario Rubio, David Sevilla
2009-04-19
Commutative Algebra · Mathematics
Closed and Irreducible Polynomials in Several Variables
Ivan V. Arzhantsev, Anatoliy P. Petravchuk
2009-08-22
Rings and Algebras · Mathematics
Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
2017-01-03
Symbolic Computation · Computer Science
Factoring sparse polynomials fast
Alexander Demin, Joris van der Hoeven
2025-02-26
Discrete Mathematics · Computer Science
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
Shuai Shao, Stanislav Živný
2024-05-24
Commutative Algebra · Mathematics
Intrinsic factorization of ideals in Dedekind domains
Mawunyo Kofi Darkey-Mensah, Przemysław Koprowski
2018-05-08
Computational Complexity · Computer Science
Deterministic Polynomial Factoring and Association Schemes
Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena
2019-02-20
Rings and Algebras · Mathematics
Factoring Ore polynomials over $\mathbb{F}_q(t)$ is difficult
Jose Gomez-Torrecillas, F. J. Lobillo, Gabriel Navarro
2015-05-28
Discrete Mathematics · Computer Science
On A Polytime Factorization Algorithm for Multilinear Polynomials Over F2
Pavel Emelyanov, Denis Ponomaryov
2019-01-08
Algebraic Geometry · Mathematics
Reaching generalized critical values of a polynomial
Zbigniew Jelonek, Krzysztof Kurdyka
2016-03-10
Logic in Computer Science · Computer Science
An applicative theory for FPH
Reinhard Kahle, Isabel Oitavem
2011-01-31