Literature DB >> 16592294

Analysis of the subtractive algorithm for greatest common divisors.

A C Yao1, D E Knuth.   

Abstract

The sum of all partial quotients in the regular continued fraction expansions of m/n, for 1 </= m </= n, is shown to be 6pi(-2)n(ln n)(2) + O(n log n(log log n)(2)). This result is applied to the analysis of what is perhaps the oldest non-trivial algorithm for number-theoretic computations.

Year:  1975        PMID: 16592294      PMCID: PMC388801          DOI: 10.1073/pnas.72.12.4720

Source DB:  PubMed          Journal:  Proc Natl Acad Sci U S A        ISSN: 0027-8424            Impact factor:   11.205


  1 in total

1.  Algorithms, complexity, and the sciences.

Authors:  Christos Papadimitriou
Journal:  Proc Natl Acad Sci U S A       Date:  2014-10-27       Impact factor: 11.205

  1 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.