Package de.tilman_neumann.jml.factor.hart
-
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_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.HartLA63 Experimental Hart algorithm assembling square congruences from smooth congruences.