A Refinement of H. C. Williams' qth Root Algorithm

DOI10.2307/2152969MaRDI QIDQ3137483zbMATH OpenOpenAlexFDO

Authors Kenneth S. Williams, Kenneth Hardy

Publication date 7 March 1994

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2152969

zbMATH Keywords

complexitycongruenceH. C. Williams' \(q\)th root algorithm

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Power residues, reciprocity (11A15) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 2154289
• scientific article; zbMATH DE number 3417539
• On the Cipolla-Lehmer type algorithms in finite fields
• scientific article; zbMATH DE number 1424189
• On Shanks' Algorithm for Modular Square Roots

Cited in

(9)

• Horner versus Holdred: An episode in the history of root computation
• A refinement of Müller's cube root algorithm
• On the Cipolla-Lehmer type algorithms in finite fields
• Taking roots over high extensions of finite fields
• Power roots of polynomials over arbitrary fields
• On K nig's root-finding algorithms*
• scientific article; zbMATH DE number 826069 (Why is no real title available?)
• scientific article; zbMATH DE number 3417539 (Why is no real title available?)
• On the computation of r-th roots in finite fields

This page was built for publication: A Refinement of H. C. Williams' qth Root Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137483)