openhub.net
Black Duck Software, Inc.
Follow @
Sign In
Join Now
Projects
People
Organizations
Tools
Blog
Projects
People
Projects
Organizations
Forums
C
Cadonfs
Settings

Report Duplicate
0
I Use This!
×
Login Required
Log in to Open Hub
Remember Me
High Activity
Commits
: Listings
Analyzed
about 16 hours
ago. based on code collected
about 16 hours
ago.
Dec 13, 2018 — Dec 13, 2019
Showing page 526 of 530
Search / Filter on:
Commit Message
Contributor
Files Modified
Lines Added
Lines Removed
Code Location
Date
Added default paths for ECM and GMP libraries/headers.
Alexander Kruppa
More...
over 12 years ago
Added rule to create empty Makefile.local if it does not exist.
Alexander Kruppa
More...
over 12 years ago
Files I forgot to add... again. :(
Alexander Kruppa
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.
Alexander Kruppa
More...
over 12 years ago
pivot index is related to columns and not rows
Paul Zimmermann
More...
over 12 years ago
polyselect.c: new experimental code for nonmonic linear polynomial TIMINGS: added new timings on RSA100 and RSA110 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()
Paul Zimmermann
More...
over 12 years ago
fixed stupid bug in last change...
Paul Zimmermann
More...
over 12 years ago
characters.c now prints recomposed vectors according to character columns
Pierrick Gaudry
More...
over 12 years ago
Oups: forgot in r175 to activate Guillaume's algorithm by default. Done now.
Paul Zimmermann
More...
over 12 years ago
implemented exact algorithm from Guillaume to compute average valuation for primes dividing the discriminant: got a nice speedup
Paul Zimmermann
More...
over 12 years ago
fixed bug when no prime is given on algebraic side
Paul Zimmermann
More...
over 12 years ago
updated README
Pierrick Gaudry
More...
over 12 years ago
A first skeleton for characters computation.
Pierrick Gaudry
More...
over 12 years ago
Fixed some problems with relations where primes in high powers divide the norm
Alexander Kruppa
More...
over 12 years ago
forgot to switch off some debug diagnostic on stderr (many lines)
Pierrick Gaudry
More...
over 12 years ago
bug fix in procrels: i++ was missing for alg side
Pierrick Gaudry
More...
over 12 years ago
implemented fast product tree on rational side
Paul Zimmermann
More...
over 12 years ago
added option to try ith dependency
Paul Zimmermann
More...
over 12 years ago
check that given primes are smaller than the corresponding large prime bounds
Paul Zimmermann
More...
over 12 years ago
fixed bug in ratsqrt.c: seems to work, now
Pierrick Gaudry
More...
over 12 years ago
print relation excess on stdout
Paul Zimmermann
More...
over 12 years ago
bug fix in procrels
Pierrick Gaudry
More...
over 12 years ago
Header file was missing in last commit
Alexander Kruppa
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.
Alexander Kruppa
More...
over 12 years ago
small cleanups
Paul Zimmermann
More...
over 12 years ago
added code from Guillaume to compute valuation for primes dividing discriminant
Paul Zimmermann
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
Paul Zimmermann
More...
over 12 years ago
now take into account linear polynomial in computation of skewness assert's are on only when DEBUG is defined
Paul Zimmermann
More...
over 12 years ago
polyselect.c: added m option, estimate valuation for gcd(a,b)=1 only TIMINGS: added timings for RSA100 and RSA120 alpha.mpl: estimate valuation for gcd(a,b)=1 only
Paul Zimmermann
More...
over 12 years ago
Rearranged most of the refactoring code. Probably somewhat faster, more speedups tbd.
Alexander Kruppa
More...
over 12 years ago
←
1
2
…
522
523
524
525
526
527
528
529
530
→
This site uses cookies to give you the best possible experience. By using the site, you consent to our use of cookies. For more information, please see our
Privacy Policy
Agree