Engineering↗
Algorithm Notation and Complexity Conventions
The notation, cost model and complexity conventions used throughout this collection, including the sub-exponential L-function.
Every page in the KEVOS library tagged complexity. 4 pages.
The notation, cost model and complexity conventions used throughout this collection, including the sub-exponential L-function.
The M(n) abstraction, the hierarchy of multiplication algorithms, and why downstream bounds are quoted in terms of M(n) rather than fixed exponents.
Why proving compositeness is easy, proving primality is harder, and factoring is harder still — and what this asymmetry means in practice.
The methods available for proving primality, their complexities, and which to use for a given size of candidate.