WATERMAN, M. S., 1976, o7. math. Analysis Applic. (to appear). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The algorithms of Euclid and Jacobi - Johnson, Waterman Self-citation (Waterman) (Correct)
....material. In performing Q(mx,m2,ma) the last coordinate is always the largest but the first is not always the smallest. It seems clear that a permutation of the first two coordinates to assure the first coordinate is smallest would speed computation. A study of such algorithms has been done in [11] and [12] where the problems are handled in n (rather than two) dimensions. Other details connected with computational problems are dealt with in [12] However, examples can be found where the permutation algorithm takes more steps. For example with (1396,7694,8593) the permutation algorithm ....
WATERMAN, M. S., 1976, o7. math. Analysis Applic. (to appear).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC