Pages that link to "Item:Q1351512"
From MaRDI portal
The following pages link to On finding primitive roots in finite fields (Q1351512):
Displaying 14 items.
- Even faster integer multiplication (Q306687) (← links)
- Deterministically generating Picard groups of hyperelliptic curves over finite fields (Q897576) (← links)
- Character sums, primitive elements, and powers in finite fields (Q1612528) (← links)
- On the complexity of integer matrix multiplication (Q1635268) (← links)
- New and explicit constructions of unbalanced Ramanujan bipartite graphs (Q2115273) (← links)
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
- On the construction of finite field elements of large order (Q2566173) (← links)
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
- Companion Matrix and Recognition of Primitive Polynomial (Q2831805) (← links)
- A multimodular algorithm for computing Bernoulli numbers (Q3160744) (← links)
- Comments on search procedures for primitive roots (Q4372647) (← links)
- Faster integer multiplication using plain vanilla FFT primes (Q4683179) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
