A modification of Shanks' baby-step giant-step algorithm

DOI10.1090/S0025-5718-99-01141-2zbMath0940.68038OpenAlexW2016765707WikidataQ56338368 ScholiaQ56338368MaRDI QIDQ4942788

David C. Terr

Publication date: 15 March 2000

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

Full work available at URL: https://doi.org/10.1090/s0025-5718-99-01141-2

zbMATH Keywords

imaginary quadratic orders

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

A Terr algorithm for computations in the infrastructure of real-quadratic number fields ⋮ Computing the structure of a finite abelian group

Cites Work

• On some computational problems in finite abelian groups
• Unnamed Item

This page was built for publication: A modification of Shanks' baby-step giant-step algorithm