在一台实际的计算机上,大整数相乘的速度有多快?
How Fast Can We Multiply Large Integers on an Actual Computer?
摘要:
我们提供了两个复杂性度量,可用于测量计算长整数乘法的算法的运行时间。具有单位成本或对数成本的随机存取机不足以测量像长整数乘法这样的任务的复杂性。图灵机在这里更有用,但未能考虑到短整数的乘法指令,这在物理计算设备上是可用的。一个有趣的结果是,所提出的改进的复杂性措施不排名众所周知的乘法算法的方式与图灵机模型。
英文摘要:
We provide two complexity measures that can be used to measure the running time of algorithms to compute multiplications of long integers. The random access machine with unit or logarithmic cost is not adequate for measuring the complexity of a task like multiplication of long integers. The Turing machine is more useful here, but fails to take into account the multiplication instruction for short integers, which is available on physical computing devices. An interesting outcome is that the proposed refined complexity measures do not rank the well known multiplication algorithms the same way as the Turing machine model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。