[ 原始碼: flintqs ]
套件:flintqs(1:1.0-4)
Program using quadratic sieve to factor integers
This package includes William Hart's program to find prime factors of large integers (at least forty digits).
It does so using highly optimized multi-polynomial quadratic sieve.
其他與 flintqs 有關的套件
|
|
|
|
-
- dep: libc6 (>= 2.34)
- GNU C 函式庫:共用函式庫
同時作為一個虛擬套件由這些套件填實: libc6-udeb
-
- dep: libgcc-s1 (>= 3.5) [armel, armhf]
- GCC 支援函式庫
- dep: libgcc-s1 (>= 4.2) [i386, mipsel]
-
- dep: libgmp10 (>= 2:6.2.1+dfsg1)
- Multiprecision arithmetic library
-
- dep: libstdc++6 (>= 4.1.1)
- GNU Standard C++ Library v3