Computational complexity of mathematical operations
The following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine. See big O notation for an explanation of the notation used. Note: Due to the variety of multiplication algorithms, below stands in for the complexity of the chosen multiplication algorithm.
- Abstraction100002137
- Act100030358
- Activity100407535
- Algorithm105847438
- Attribute100024264
- Condition113920835
- Difficulty114408086
- Event100029378
- Problem114410605
- Procedure101023820
- PsychologicalFeature100023100
- Rule105846932
- State100024720
- WikicatComputerArithmeticAlgorithms
- WikicatNumberTheoreticAlgorithms
- WikicatUnsolvedProblemsInComputerScience
- YagoPermanentlyLocatedEntity
- Comment
- enThe following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine. See big O notation for an explanation of the notation used. Note: Due to the variety of multiplication algorithms, below stands in for the complexity of the chosen multiplication algorithm.
- Depiction
- Has abstract
- enThe following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine. See big O notation for an explanation of the notation used. Note: Due to the variety of multiplication algorithms, below stands in for the complexity of the chosen multiplication algorithm.
- Is primary topic of
- Computational complexity of mathematical operations
- Label
- enComputational complexity of mathematical operations
- Link from a Wikipage to another Wikipage
- Addition
- Agrawal's conjecture
- AKS primality test
- Algorithm
- Analytic function
- Arithmetic-geometric mean
- Arithmetic–geometric mean
- Baillie–PSW primality test
- Balázs Szegedy
- Bareiss algorithm
- Big O notation
- Binary GCD algorithm
- Binary splitting
- Bit-burst algorithm
- Category:Computational complexity theory
- Category:Computer arithmetic algorithms
- Category:Mathematics-related lists
- Category:Number theoretic algorithms
- Category:Unsolved problems in computer science
- Chris Umans
- Computational complexity
- Computational complexity of matrix multiplication
- Computational number theory
- Coppersmith–Winograd algorithm
- Determinant
- Discrete Fourier transform
- Division (mathematics)
- E (mathematical constant)
- Elementary function
- Elliptic curve primality proving
- Euclidean algorithm
- Euler–Mascheroni constant
- Exponential function
- Exponential integral
- Exponentiation by squaring
- Factorial
- Fast Fourier transform
- File:Comparison computational complexity.svg
- Finite field
- Floating-point arithmetic
- Galactic algorithm
- Gamma function
- Gauss–Jordan elimination
- Gauss–Legendre algorithm
- General number field sieve
- Golden ratio
- Greatest common divisor
- Harvey-Hoeven algorithm
- Henry Cohn
- Horner's method
- Hypergeometric function
- Incomplete gamma function
- Integer factorization
- Integral transform
- Jacobi symbol
- Karatsuba algorithm
- Laplace expansion
- Long division
- LU decomposition
- Machin's formula
- Mathematical analysis
- Mathematical operation
- Matrix inversion
- Matrix multiplication algorithm
- Miller–Rabin primality test
- Modular exponentiation
- Montgomery reduction
- Multiplication
- Multiplication algorithm
- Multitape Turing machine
- Natural logarithm
- Newton's method
- Newton–Raphson division
- Number theory
- Pi
- Polynomial
- Primality test
- Quantum computer
- Robert Kleinberg
- Schönhage controlled Euclidean descent algorithm
- Schönhage–Strassen algorithm
- Shor's algorithm
- Signal processing
- Singular value decomposition
- Solovay–Strassen primality test
- Square root
- Square root of 2
- Stehlé–Zimmermann algorithm
- Strassen algorithm
- Subtraction
- Taylor series
- The Art of Computer Programming
- Time complexity
- Toom–Cook multiplication
- Transformation (function)
- Triangular matrix
- Trigonometric function
- SameAs
- 4i4e6
- Complexidade computacional de operações matemáticas
- Computational complexity of mathematical operations
- Kompleksitet i matematikk
- m.0g7nkj
- Q5157305
- Výpočetní složitost matematických operací
- پیچیدگی محاسباتی اعمال ریاضی
- Subject
- Category:Computational complexity theory
- Category:Computer arithmetic algorithms
- Category:Mathematics-related lists
- Category:Number theoretic algorithms
- Category:Unsolved problems in computer science
- Thumbnail
- WasDerivedFrom
- Computational complexity of mathematical operations?oldid=1123129259&ns=0
- WikiPageLength
- 24585
- Wikipage page ID
- 6497220
- Wikipage revision ID
- 1123129259
- WikiPageUsesTemplate
- Template:Cite book
- Template:Clear
- Template:Main
- Template:Math
- Template:More citations needed
- Template:Refbegin
- Template:Refend
- Template:Reflist
- Template:Short description
