On the factorization of polynomials in a finite number of steps

DOI10.1007/BF01180640MaRDI QIDQ2653557zbMATH OpenOpenAlexWikidataFDO

Authors A. Fröhlich, John Shepherdson

Publication date 1955

Published in Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/169498

zbMATH Keywords

linear algebra, polynomials

Cited in

(11)

• Recursion theory on fields and abstract dependence
• Über konstruktive Methoden der Galoistheorie
• On the complexity of the Lickteig-Roy subresultant algorithm
• Directed evaluation
• Accelerated tower arithmetic
• A unified approach to the Galois closure problem
• Fast separable factorization and applications
• Bounded-degree factors of lacunary multivariate polynomials
• On the decidability of the theory of modules over the ring of algebraic integers
• Factoring sparse polynomials fast
• Plane curve germs and contact factorization

This page was built for publication: On the factorization of polynomials in a finite number of steps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2653557)