Pages that link to "Item:Q2206416"
From MaRDI portal
The following pages link to Computational aspects of irreducible polynomials (Q2206416):
Displaying 4 items.
- Deterministically Computing Reduction Numbers of Polynomial Ideals (Q2879324) (← links)
- Computer Discovery and Analysis of Large Poisson Polynomials (Q4976190) (← links)
- Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts (Q5226549) (← links)
- Computational experiences on the distances of polynomials to irreducible polynomials (Q5691019) (← links)