Computational aspects of irreducible polynomials (Q2206416)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational aspects of irreducible polynomials |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational aspects of irreducible polynomials |
scientific article |
Statements
Computational aspects of irreducible polynomials (English)
0 references
22 October 2020
0 references
In this paper, an upper bound for the height of polynomial divisors of a given polynomial belonging to \(\mathbb Z[x]\) is computed, which is better than an already known bound. The author also gives constructive examples of a class of irreducible polynomials over discrete valued fields using Newton's polygon.
0 references
computer polynomial algebra
0 references
polynomial divisors
0 references
irreducible polynomials
0 references
0 references
0 references
