On the Estimation of Coefficients of Irreducible Factors of Polynomials over a Field of Formal Power Series in Nonzero Characteristic
-
Published:2019-11
Issue:3
Volume:100
Page:542-544
-
ISSN:1064-5624
-
Container-title:Doklady Mathematics
-
language:en
-
Short-container-title:Dokl. Math.
Publisher
Pleiades Publishing Ltd
Subject
General Mathematics
Reference3 articles.
1. A. L. Chistov, St. Petersburg Math. J. 28 (6), 825–853 (2017).
2. A. L. Chistov, “Polynomial complexity of the Newton–Puiseux algorithm,” in Wiedermann International Symposium on Mathematical Foundations of Computer Science 1986, Ed. J. Gruska and B. Rovan, Lecture Notes in Computer Science (Springer-Verlag, Berlin, 1986), Vol. 233, pp. 247–255.
3. Z. I. Borevich and I. R. Shafarevich, Number Theory (Nauka, Moscow, 1964; Academic, London, 1966). https://doi.org/10.1007/BFb0016248