 This table gives the complexity of computing approximations to the given constants to "n" correct digits.Algorithms for number theoretical calculations are studied in computational number theory.The following complexity figures assume that arithmetic with individual elements has complexity "O"(1), as is the case with fixed-precision floating-point arithmetic or operations on a finite field.