Computational complexity of mathematical operations

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. See big O notation for an explanation of the notation used. This video is targeted to blind users. Attribution: Article text available under CC-BY-SA Creative Commons image source in video