Pages that link to "Item:Q4148947"
From MaRDI portal
The following pages link to On the Efficiency of a Polynomial Irreducibility Test (Q4148947):
Displaying 8 items.
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- Fast recognition of alternating and symmetric Galois groups (Q1585066) (← links)
- Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability (Q2830234) (← links)
- On Polynomial Factorization Over Finite Fields (Q3924300) (← links)
- Ewens Sampling and Invariable Generation (Q4554773) (← links)
- Digital collections of examples in mathematical sciences (Q6086393) (← links)
- Methodologies of Symbolic Computation (Q6163846) (← links)