Pages that link to "Item:Q1180998"
From MaRDI portal
The following pages link to Computational problems in the theory of finite fields (Q1180998):
Displaying 10 items.
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Factorization of polynomials and some linear-algebra problems over finite fields (Q1311328) (← links)
- Construction of logarithm tables for Galois Fields (Q3069685) (← links)
- (Q3137899) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- Primitive Normal Polynomials Over Finite Fields (Q4317674) (← links)
- (Q4390716) (← links)
- (Q4981685) (← links)
- Computing isomorphisms and embeddings of finite fields (Q5880524) (← links)
- On the hardness of the finite field isomorphism problem (Q6083668) (← links)