Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Computational complexity of mathematical operations
open-in-new
<p>The following tables list the <a href="/facts/Computational_complexity/Qenh22Ja">computational complexity</a> of various <a href="/facts/Algorithm/fnl5NmRt">algorithms</a> for common <a href="/facts/Mathematical_operation/Yplv602Q">mathematical operations</a>. </p><p>Here, complexity refers to the <a href="/facts/Time_complexity/77T62gmf">time complexity</a> of performing computations on a <a href="/facts/Multitape_Turing_machine/FNgX7VJL">multitape Turing machine</a>. See <a href="/facts/Big_O_notation/weFFjSWg">big O notation</a> for an explanation of the notation used. </p><p>Note: Due to the variety of multiplication algorithms, M ( n ) {\displaystyle M(n)} below stands in for the complexity of the chosen multiplication algorithm. </p>