%T On the Worst Case of Three Algorithms for Computing the Jacobi Symbol
%A Jeffrey Shallit
%R Technical Report PCS-TR89-140
%I Dartmouth College, Computer Science
%C Hanover, NH
%D  1989
%U http://www.cs.dartmouth.edu/reports/TR89-140.pdf
%X
 	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).