Polynomial factorization: Sharp bounds, efficient algorithms
type: Item
instance of: scholarly article
title: Polynomial factorization: Sharp bounds, efficient algorithms
zbMATH Open document ID: 0801.12007
author: Bernard Beauzamy
author: Vilmar Trevisan
author: Paul S. Wang
published in: Journal of Symbolic Computation
publication date: 1993-12-16T00:00:00Z
review text: The paper shows that, in order to realize fast algorithms, it is necessary to control the size of the coefficients in one irreducible factor. A bound on this size is presented in Theorem 1. It makes use of the weighted norm and it is almost optimal. The paper shows how to use this bound in the process of \(p\)-adic lifting in such a way to obtain an efficient algorithm. A worked example completes the paper.
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 13P05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 11Y40
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 440044
zbMATH Keywords: polynomial factorization
zbMATH Keywords: \(p\)-adic lifting
zbMATH Keywords: efficient algorithm
reviewed by: Giovanni Gallo
MaRDI profile type: Publication
full work available at URL: jsco.1993.1028
OpenAlex ID: W2052120705
DOI: 10.1006/JSCO.1993.1028
description: scientific article; zbMATH DE number 440044