数学运算的计算复杂性.docxVIP

数学运算的计算复杂性 The following tables list the? HYPERLINK /wiki/Analysis_of_algorithms \o Analysis of algorithms running time?of various? HYPERLINK /wiki/Algorithm \o Algorithm algorithms?for common? HYPERLINK /wiki/Mathematical_operation \o Mathematical operation mathematical operations. Here, complexity refers to the? HYPERLINK /wiki/Time_complexity \o Time complexity time complexity?of performing computations on a? HYPERLINK /wiki/Multitape_Turing_machine \o Multitape Turing machine multitape Turing machine. HYPERLINK /wiki/Computational_complexity_of_mathematical_operations \l cite_note-Schonhage-1 [1]?See? HYPERLINK /wiki/Big_O_notation \o Big O notation big O notation?for an explanation of the notation used. 算术函数（Arithmetic functions） 操作输入 输出 算法复杂度 加 Addition两个n位数一个n+1位的数Schoolbook addition with carryΘ(n) 减 Subtraction两个n位数一个n+1位的数Schoolbook subtraction with borrowΘ(n) 乘 Multiplication 两个n位数 2n位的数Schoolbook long multiplicationO(n2)Karatsuba algorithmO(n1.585)3-way Toom–Cook multiplicationO(n1.465)k-way Toom–Cook multiplicationO(nlog (2k?? 1)/log?k)Mixed-level Toom–Cook O(n?2√2 log?n?log?n)Sch?nhage–Strassen algorithmO(nlog?n?log log?n)Fürers algorithmO(n?log?n?2 HYPERLINK /wiki/Iterated_logarithm \o Iterated logarithm log*?n) 除 Division两个n位数一个n位的数Schoolbook long divisionO(n2)Newton–Raphson divisionO(M(n)) Square root一个n位数一个n位的数Newtons methodO(M(n))模幂Modular exponentiation两个n位数和一个k位的指数一个n位的数Repeated multiplication and reductionO(2kM(n))Exponentiation by squaring 幂的平方O(k M(n))Exponentiation with Montgomery reductionO(k M(n))Schnorr and Stumpf conjectured that no fastest algorithm for multiplication exists. 乘法没有最快的算法。 代数函数 操作输入输出算法复杂度Polynomial evaluation 多项式评价One polynomial of degree n with fixed-size polynomial coefficientsOne fixed-size number 一个固定大小的数Direct evaluation 直接评估Θ(n)Horners method 霍纳方法Θ(n)Polynomial gcd (over