The following pages link to (Q3137899):
Displaying 35 items.
- Counting curves and their projections (Q677992) (← links)
- An algorithm for Lang's theorem. (Q731239) (← links)
- On arithmetical algorithms over finite fields (Q910432) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- A deterministic test for permutation polynomials (Q1207336) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- On finding primitive roots in finite fields (Q1351512) (← links)
- Almost weakly self-dual bases for finite fields (Q1352414) (← links)
- Long binary narrow-sense BCH codes are normal (Q1352424) (← links)
- A note on character sums with polynomial arguments. (Q1414021) (← links)
- On group automata over finite fields. (Q1418183) (← links)
- Non-standard finite fields over \(I\Delta_0+\Omega_1\) (Q1567349) (← links)
- Factoring polynomials over arbitrary finite fields (Q1575686) (← links)
- Finite field towers: Iterated presentation and complexity of arithmetic. (Q1609402) (← links)
- On irreducible polynomials of small height over finite fields (Q1925009) (← links)
- Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\) (Q2130027) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Finite integer computations: An algebraic foundation for their correctness (Q2432238) (← links)
- On the subfield subcodes of Hermitian codes (Q2436577) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- On upper bounds of Chalk and Hua for exponential sums (Q2716091) (← links)
- (Q3305164) (← links)
- Calculating the set of orders of elements in the finite linear groups (Q3545834) (← links)
- Primitive Normal Polynomials Over Finite Fields (Q4317674) (← links)
- On a New Factorization Algorithm for Polynomials Over Finite Fields (Q4325734) (← links)
- Generators and irreducible polynomials over finite fields (Q4340866) (← links)
- (Q4390716) (← links)
- Fast message authentication using efficient polynomial evaluation (Q4639340) (← links)
- (Q4699468) (← links)
- An improved Mordell type bound for exponential sums (Q4825618) (← links)
- Distinct Degree Factorizations for Polynomials over a Finite Field (Q4846077) (← links)
- (Q4981685) (← links)
- Topics in Galois Fields (Q5138447) (← links)
- The computational complexity of recognizing permutation functions (Q5917358) (← links)
- Orders of Gauss periods in finite fields (Q6487964) (← links)
