一个基于分治法的快速多精度乘法

A fast algorithm of multiple-precision multiplication based on divide-and-conquer method

多精度运算中,乘法的设计与实现非常复杂,传统的多精度乘法的时间复杂度为O(n2),基于分治法介绍了一种改进的快速乘法,通过理论分析,改进算法的时间复杂度为O(nlog23).

In multipleprecision algorithm, the design and implementation of multiplication are very complicated. The time complicity of traditional multipleprecision multiplication algorithms is O (n2). In this paper, an improved fast algorithm based on divide-and-conquer method is introduced. By analyzing the algorithm, the time complicity of this new algorithm is O (nlog23).