scientific article; zbMATH DE number 1303185

zbMath0928.11055MaRDI QIDQ4249708

Scott Lindhurst

Publication date: 31 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lebesgue's dominated convergence theoremlinear recurrence relationsaverage time complexityDirichlet's theorem on arithmetic progressionsShanks's algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (6)

Improved generalized Atkin algorithm for computing square roots in finite fields ⋮ Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm ⋮ Unnamed Item ⋮ Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) ⋮ Unnamed Item ⋮ New cube root algorithm based on the third order linear recurrence relations in finite fields

This page was built for publication: