Algorithm of polynomial complexity for factoring polynomials over local fields
type: Item
instance of: scholarly article
title: Algorithm of polynomial complexity for factoring polynomials over local fields
zbMATH Open document ID: 0835.11047
DOI: 10.1007/BF02112431
published in: Journal of Mathematical Sciences (New York)
publication date: 1992-09-27T00:00:00Z
review text: See the review in Zbl 0761.11046.
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11Y40
zbMATH DE Number: 58720
zbMATH Keywords: Newton polygons
zbMATH Keywords: algorithm
zbMATH Keywords: factoring multivariable polynomials over local fields
zbMATH Keywords: polynomial time
zbMATH Keywords: integral basis
author: A. L. Chistov
MaRDI profile type: Publication
cites work: Q5184990
cites work: Q4712895
full work available at URL: https://doi.org/10.1007/bf02112431
OpenAlex ID: W2077346602
description: scientific article; zbMATH DE number 58720