Jump to content

User:AlexandrianCanadian/Books/Computational complexity of mathematical operations- Vol2

From Wikipedia, the free encyclopedia


Computational complexity of mathematical operations Vol2

[edit]
Computational complexity of mathematical operations
Matrix multiplication
Addition
Subtraction
Multiplication
Multiplication algorithm
Karatsuba algorithm
Toom–Cook multiplication
Schönhage–Strassen algorithm
Fürer's algorithm
Division (mathematics)
Long division
Division algorithm
Square root
Modular exponentiation
Exponentiation by squaring
Montgomery modular multiplication
Polynomial
Horner's method
Euclidean algorithm
Elementary function
Exponential function
Natural logarithm
Trigonometric functions
Analytic function
Taylor series
Fast Fourier transform
Binary splitting
Arithmetic–geometric mean
Gamma function
Incomplete gamma function
Hypergeometric function
Golden ratio
Newton's method
Square root of 2
E (mathematical constant)
John Machin
Pi
Gauss–Legendre algorithm
Euler–Mascheroni constant
Exponential integral
Number theory
Computational number theory
Greatest common divisor
Binary GCD algorithm
Jacobi symbol
Factorial
Strassen algorithm
Coppersmith–Winograd algorithm
Invertible matrix
Gaussian elimination
Determinant
Laplace expansion
LU decomposition
Bareiss algorithm
Triangular matrix
Divide and conquer algorithms