Bigint (bigbit) library

梦想的初衷 提交于 2019-11-26 19:06:27

There are several, including GMP, but for speed, the best is likely TTmath. TTmath's design decision to use templated fixed lengths at compiletime lets it be quite fast.

try gmp library. It is a C library. Beginning with GMP 4.0 a C++ wrapper is bundled with the release.

Just consider the big integer multiplication, the TTmath Library use Karatsuba algorithm, which has time complexity $O(n^{1.585})$. The fastest algorithm is $O(n log n log log n)$, using FFT.

标签
易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!