Deterministic distinct-degree factorization of polynomials over finite fields

Autor:	Alan G. B. Lauder, Erich Kaltofen, Shuhong Gao
Jazyk:	angličtina
Rok vydání:	2016
Předmět:	Multivariate polynomial Discrete mathematics Algebra and Number Theory Irreducible polynomial Deterministic algorithm Factorization of polynomials over finite fields 010103 numerical & computational mathematics 0102 computer and information sciences 01 natural sciences Polynomial matrix Distinct-degree factorization Computational Mathematics Symmetric polynomial 010201 computation theory & mathematics Cantor–Zassenhaus algorithm Factorization of polynomials Elementary symmetric polynomial Polynomial greatest common divisor 0101 mathematics Mathematics
Popis:	A deterministic polynomial time algorithm is presented for finding the distinct-degree factorization of multivariate polynomials over finite fields. As a consequence, one can count the number of irreducible factors of polynomials over finite fields in deterministic polynomial time, thus resolving a theoretical open problem of Kaltofen from 1987. © 2004 Elsevier Ltd. All rights reserved.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dda4118961e711392c81308cf6c7b659 https://doi.org/10.1016/j.jsc.2004.05.004 Zobrazit plný text záznamu