Extracting sparse factors from multivariate integral polynomials
type: Item
instance of: scholarly article
title: Extracting sparse factors from multivariate integral polynomials
zbMATH Open document ID: 1278.12008
author: Luiz Emilio Allem
author: Shuhong Gao
author: Vilmar Trevisan
published in: Journal of Symbolic Computation
publication date: 2013-03-11T00:00:00Z
review text: A algorithm for the following problem is presented. Given a sparse multivariate polynomial in several variables over the integers, and a bound \(t\), find all factors with at most \(t\) terms. The algorithm is probabilistic with expected polynomial time in \(t\), the number of variables, the height of the coefficients, the number of terms of the polynomial, and the degree of the polynomial.
reviewed by: Josef Schicho
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 11T06
zbMATH DE Number: 6143066
zbMATH Keywords: polynomial factorization
zbMATH Keywords: discrete logarithm
zbMATH Keywords: sparse polynomial
MaRDI profile type: Publication
full work available at URL: j.jsc.2012.05.009
OpenAlex ID: W2076786012
DOI: 10.1016/J.JSC.2012.05.009
description: scientific article; zbMATH DE number 6143066