-
Class Summary
Class |
Description |
Hart_AnalyzeCongruences |
Analyze the congruences best matching Hart's one-line factor algorithm when tested with 4kN values,
where k are multiples of some K_MULT.
|
Hart_AnalyzeSquareCongruences |
Analyze until which s we obtain test == "some square" (mod 2^s).
|
Hart_Fast |
Pretty simple yet fast variant of Hart's one line factorizer.
|
Hart_Fast2Mult |
Pretty simple yet fast variant of Hart's one line factorizer.
|
Hart_Fast2Mult_FMA |
A variant of Hard_Fast2Mult using Math.fma().
|
Hart_Fast2Mult2 |
A variant of class Hart_Fast2Mult that is about 10% faster in the long end.
|
Hart_Simple |
Simple implementation of Hart's one line factor algorithm.
|
Hart_Squarefree |
A variant of Hart's one line factorizer using k = 315 * s, where s is squarefree (1,2,3,5,6,7,10,11,13,...).
|
Hart_TDiv_Race |
A factoring algorithm racing Hart's one line factorizer against trial division.
|
Hart_TDiv_Race2 |
A factoring algorithm racing Hart's one line factorizer against trial division.
|