Pages that link to "Item:Q3311656"
From MaRDI portal
The following pages link to A Generalized Class of Polynomials that are Hard to Factor (Q3311656):
Displayed 7 items.
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Certifying Irreducibility in $${\mathbb Z}[x]$$ (Q5041081) (← links)
- Integer polynomials with roots mod \(p\) for all primes \(p\) (Q5939578) (← links)