On the worst case of three algorithms for computing the Jacobi symbol
From MaRDI portal
DOI10.1016/S0747-7171(08)80160-5zbMATH Open0715.11072OpenAlexW1967135503MaRDI QIDQ752075FDOQ752075
Authors: Jeffrey Shallit
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80160-5
Recommendations
Analysis of algorithms and problem complexity (68Q25) Power residues, reciprocity (11A15) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- On a theorem of Heilbronn
- Fast computation of continued fraction expansions.
- Prime numbers and computer methods for factorization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Über die mittlere Schrittanzahl bei Divisionsalgorithmen
- Erratum: A Fast Monte-Carlo Test for Primality
- Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten Ganzen
- Computational problems associated with Racah algebra
- Title not available (Why is that?)
- A modification of the RSA public-key encryption procedure (Corresp.)
- Title not available (Why is that?)
- The Jacobi symbol algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: On the worst case of three algorithms for computing the Jacobi symbol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q752075)