Factoring bivariate sparse (lacunary) polynomials

Mostrar todas las versiones(3)

We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K [x, y] over an algebraic number field K and their multiplicities, whose running time is polynomial over the rationals, in the bit length of the sparse encoding of the input...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Avendaño, M., Krick, T., Sombra, M.
Formato: JOUR
Materias:
Height of points
Lacunary (sparse) polynomials
Lehmer's problem
Polynomial factorization
Algebra
Degrees of freedom (mechanics)
Factorization
Problem solving
Polynomials
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0885064X_v23_n2_p193_Avendano
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares