CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed. (April 2015) The following tables list the running time of various algorithms for common mathematical operations . Here, complexity refers to the time complexity of performing computations on a multitape Turing machine . [ 1 ] See big O notation for an explanation of the notation used. Note: Due to the variety of multiplication algorithms, M ( n ) below stands in for the complexity of the chosen multiplication algorithm. 1 Arithmetic functions 2 Algebraic functions 3 Special functions 3.1 Elementary functions 3.2 Non-elementary functions 3.3 Mathematical constants 4 Number theory 5 Ma...