0
I Use This!
High Activity

Commits : Listings

Analyzed about 16 hours ago. based on code collected about 16 hours ago.
Dec 13, 2018 — Dec 13, 2019
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
Added default paths for ECM and GMP libraries/headers. Anon32 More... over 12 years ago
Added rule to create empty Makefile.local if it does not exist. Anon32 More... over 12 years ago
Files I forgot to add... again. :( Anon32 More... over 12 years ago
Split code for reading polynomial file into separate file. Small fix in siever that caused unnecessary refactoring. Cleanup of Makefile. Anon32 More... over 12 years ago
pivot index is related to columns and not rows Anon32 More... over 12 years ago
polyselect.c: new experimental code for non-monic linear polynomial TIMINGS: added new timings on RSA-100 and RSA-110 alpha.mpl: now use Guillaume's exact code to compute alpha(F) gauss.c: print cputime and total estimated time cado.h: added routine cputime() Anon32 More... over 12 years ago
fixed stupid bug in last change... Anon32 More... over 12 years ago
characters.c now prints recomposed vectors according to character columns Anon32 More... over 12 years ago
Oups: forgot in r175 to activate Guillaume's algorithm by default. Done now. Anon32 More... over 12 years ago
implemented exact algorithm from Guillaume to compute average valuation for primes dividing the discriminant: got a nice speedup Anon32 More... over 12 years ago
fixed bug when no prime is given on algebraic side Anon32 More... over 12 years ago
updated README Anon32 More... over 12 years ago
A first skeleton for characters computation. Anon32 More... over 12 years ago
Fixed some problems with relations where primes in high powers divide the norm Anon32 More... over 12 years ago
forgot to switch off some debug diagnostic on stderr (many lines) Anon32 More... over 12 years ago
bug fix in procrels: i++ was missing for alg side Anon32 More... over 12 years ago
implemented fast product tree on rational side Anon32 More... over 12 years ago
added option to try ith dependency Anon32 More... over 12 years ago
check that given primes are smaller than the corresponding large prime bounds Anon32 More... over 12 years ago
fixed bug in ratsqrt.c: seems to work, now Anon32 More... over 12 years ago
print relation excess on stdout Anon32 More... over 12 years ago
bug fix in procrels Anon32 More... over 12 years ago
Header file was missing in last commit Anon32 More... over 12 years ago
Refactoring now uses the approximate log after sieving as a hint when to stop trial dividing. Refactoring about twice as fast as r133 for c80. More speedups/cleanups tbd. Anon32 More... over 12 years ago
small cleanups Anon32 More... over 12 years ago
added code from Guillaume to compute valuation for primes dividing discriminant Anon32 More... over 12 years ago
detailed the meaning of 'skewness' (now follows Kleinjung instead of Bernstein) improved the accuracy of the contribution to alpha for bad primes Anon32 More... over 12 years ago
now take into account linear polynomial in computation of skewness assert's are on only when DEBUG is defined Anon32 More... over 12 years ago
polyselect.c: added -m option, estimate valuation for gcd(a,b)=1 only TIMINGS: added timings for RSA-100 and RSA-120 alpha.mpl: estimate valuation for gcd(a,b)=1 only Anon32 More... over 12 years ago
Rearranged most of the refactoring code. Probably somewhat faster, more speedups tbd. Anon32 More... over 12 years ago