General number field sieve
In number theory, the general number field sieve is the most efficient classical algorithm known for factoring integers larger than 10¹⁰⁰. Heuristically, its complexity for factoring an integer n is of the form
in O and L-notations. Wikipedia