Algorithms related to the decomposition of polynomials
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3497962 (Why is no real title available?)
- scientific article; zbMATH DE number 3249033 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3186965 (Why is no real title available?)
- An Inequality About Factors of Polynomials
- An application of Jensen's formula to polynomials
- Congruent numbers
- Critères d'irreductibilite de polynômes sur un corps de nombres
- On Hensel factorization. I
- Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»
Cited in
(9)- Algorithmic polynomials
- Algorithm for computing the truncation of the discriminant of a polynomial
- scientific article; zbMATH DE number 4101330 (Why is no real title available?)
- Algorithmic Polynomials
- Algorithms for computing triangular decompositions of polynomial systems
- scientific article; zbMATH DE number 4111909 (Why is no real title available?)
- Deux propriétés décidables des suites récurrentes linéaires
- scientific article; zbMATH DE number 5957430 (Why is no real title available?)
- Univariate polynomial factorization over finite fields
This page was built for publication: Algorithms related to the decomposition of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1224854)