Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Analysis of Some Elementary Algorithms for Prime Factorization.

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • نبذة مختصرة :
      For factoring a positive integer n into primes, four variants of the elementary algorithm are analysed. The worst-case time complexities vary from Θ(√n) up to Θ(√nlog n). The average time complexities vary from Θ(√n) up to Θ(√n/log² n). [ABSTRACT FROM AUTHOR]