Mon, 18 Feb 2013 08:52:23 +0100 Andreas Lochbihler simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
Sun, 17 Feb 2013 22:56:54 +0100 haftmann fundamentals about discrete logarithm and square root
Sun, 17 Feb 2013 21:29:30 +0100 haftmann Sieve of Eratosthenes
Sun, 17 Feb 2013 20:45:49 +0100 haftmann note on parallel computation
Sun, 17 Feb 2013 19:39:00 +0100 haftmann corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
Sun, 17 Feb 2013 11:34:40 +0100 haftmann simplified construction of upto_aux
(0) -30000 -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 tip