On the factorization of polynomials in a finite number of steps
From MaRDI portal
Publication:2653557
DOI10.1007/BF01180640zbMath0064.24902OpenAlexW1973450794WikidataQ56144903 ScholiaQ56144903MaRDI QIDQ2653557
Albrecht Froehlich, John C. Shepherdson
Publication date: 1955
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/169498
Related Items
Bounded-degree factors of lacunary multivariate polynomials ⋮ A unified approach to the Galois closure problem ⋮ Directed evaluation ⋮ Fast separable factorization and applications ⋮ Recursion theory on fields and abstract dependence ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ On the decidability of the theory of modules over the ring of algebraic integers ⋮ Über konstruktive Methoden der Galoistheorie ⋮ Accelerated tower arithmetic