Algorithms related to the decomposition of polynomials
From MaRDI portal
Publication:1224854
DOI10.1016/0304-3975(76)90058-XzbMath0324.65020MaRDI QIDQ1224854
Publication date: 1976
Published in: Theoretical Computer Science (Search for Journal in Brave)
linear factorsinteger polynomialsdecomposition of polynomialsdecomposition of an idealirreducibility tests mod ppolynomials mod pZassenhaus algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Univariate polynomial factorization over finite fields ⋮ Deux propriétés décidables des suites récurrentes linéaires
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Hensel factorization. I
- Critères d'irreductibilite de polynômes sur un corps de nombres
- An application of Jensen's formula to polynomials
- An Inequality About Factors of Polynomials
- Congruent numbers
- Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»
This page was built for publication: Algorithms related to the decomposition of polynomials
