The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Factoring polynomials over global fields”

On the computation of the GCD of 2-D polynomials

Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.

Practical Aurifeuillian factorization

Bill Allombert, Karim Belabas (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We describe a simple procedure to find Aurifeuillian factors of values of cyclotomic polynomials Φ d ( a ) for integers a and d > 0 . Assuming a suitable Riemann Hypothesis, the algorithm runs in deterministic time O ˜ ( d 2 L ) , using O ( d L ) space, where L log ( a + 1 ) .

On Garcia numbers.

Brunotte, Horst (2009)

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

Similarity: