Algorithms in Number Theory

Lenstra, A. K., & Jr, H. W. L. (1990). Algorithms in Number Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

Type

Book chapter

Intellectual base

Review or monograph

Year

1990

Link

https://infoscience.epfl.ch/bitstreams/927c2239-2f2d-47e0-94ad-f5d831e9bd1d/download

Cited by

1 citation across 1 artifact.

Domain-specific

• L-notation
  • The construction emerged from comparisons among integer-factorization algorithms and was generalized into its standard two-parameter form in the Lenstras’ treatment of algorithms in number theory.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:c92ca69646d7 · see in the full table