BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR89-140
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: On the Worst Case of Three Algorithms for Computing the Jacobi Symbol
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Shallit, Jeffrey
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1989
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR89-140.pdf
ABSTRACT::
	We study the worst-case behavior of three iterative
algorithms- Eisenstein's algorithm, Lebesgue's algorithm, and the
"ordinary" Jacobi symbol algorithm - for computing the Jacobi symbol.
Each algorithm is similar in format to the Euclidean algorithm for
computing gcd (u,v).
END:: ncstrl.dartmouthcs//TR89-140