Skip to main content
SpringerLink
Log in

Analysis of Some Elementary Algorithms for Prime Factorization

  • Short Communication
  • Published:
Computing Aims and scope Submit manuscript

Abstract

For factoring a positive integer n into primes, four variants of the elementary algorithm are analysed. The worst-case time complexities vary from Θ() up to Θ(). The average time complexities vary from Θ() up to Θ().

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Fakultät für Mathematik und Informatik TU Bergakademic Freiberg D-09596 Freiberg Germany e-mail: schatte@mathe.tu-freiberg.de, , , , , , DE

    Helge Bahmann & Peter Schatte

Authors
  1. Helge Bahmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Schatte
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received August 21, 1998; revised September 14, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bahmann, H., Schatte, P. Analysis of Some Elementary Algorithms for Prime Factorization. Computing 66, 91–95 (2001). https://doi.org/10.1007/s006070170040

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s006070170040

Search

Navigation