NFB integer factorization Activity
No-factor-base (NFB) sub-exponential factorization algorithm
Brought to you by:
egghead-lab
Activity for NFB integer factorization
-
Pavel Malyshkin modified ticket #3
double log(intstr)
-
unnecessary
-
Generating primes
-
minor change
-
intstr lib
-
double log(intstr)
-
double log(intstr)
-
The GCD tests are commented in UnitTests.cpp
-
Unit tests restored in revision 3
-
unit tests on CExtractor
-
node indexing bug fix
-
The GCD tests are commented in UnitTests.cpp
-
intstr lib
-
Better than L(1/3, 2) complexity, not exactly measured.
1
