Add support for Texinfo-5.0.
[ginac.git] / ginac / polynomial /
2012-02-23 Alexei SheplyakovMerge branch 'master' of git://github.com/AlexeiSheplya...
2011-10-22 Richard KreckelFix warning "control reaches end of non-void function".
2011-02-04 Richard KreckelExtend copyright to 2011.
2011-02-03 Richard KreckelDon't try to tie the library version to the package...
2011-02-03 Richard KreckelMerge branch 'msvc.support' of git://github.com/AlexeiS...
2010-12-04 Alexei Sheplyakov[PATCH 2/2] chinrem_gcd: return correct integer content...
2010-12-04 Alexei Sheplyakov[PATCH 1/2] extract_integer_content: check for rational...
2010-12-03 Alexei Sheplyakov[PATCH 2/2] chinrem_gcd: return correct integer content...
2010-12-03 Alexei Sheplyakov[PATCH 1/2] extract_integer_content: check for rational...
2010-11-26 Jan RheinländerOmit extra qualification (as in struct foo f() vs foo...
2010-11-23 Alexei Sheplyakov[bugfix] chinrem_gcd: handle polynomials over rationals...
2010-11-23 Alexei Sheplyakov[bugfix] chinrem_gcd: handle polynomials over rationals...
2010-05-17 Alexei Sheplyakovpgcd(), chinrem_gcd(): use appropriate definition of...
2010-05-17 Alexei SheplyakovAdded `degree_vector' utility function.
2010-05-17 Alexei Sheplyakovprimpart_content: correctly handle monomials.
2010-05-17 Alexei Sheplyakovpgcd(): avoid infinite loop if the first GCD candidate...
2010-05-17 Alexei Sheplyakovpgcd(), chinrem_gcd(): use appropriate definition of...
2010-05-17 Alexei SheplyakovAdded `degree_vector' utility function.
2010-05-17 Alexei Sheplyakovprimpart_content: correctly handle monomials.
2010-05-17 Alexei Sheplyakovpgcd(): avoid infinite loop if the first GCD candidate...
2010-03-05 Jens VollingaCopyright goes 2010.
2010-03-05 Jens VollingaCopyright goes 2010.
2010-02-27 Richard KreckelUpdate copyright notice.
2010-02-24 Alexei Sheplyakovpgcd(): detect relatively prime polynomials properly...
2010-02-24 Alexei Sheplyakovpgcd(): detect relatively prime polynomials properly...
2009-02-06 Jens VollingaPrettified source code.
2009-02-06 Alexei SheplyakovFix chinese_remainder() so modular GCD actually works.
2009-02-05 Jens VollingaRenamed files *.tcc and *.hpp to *.h.
2009-02-03 Jens VollingaFixed compile errors introduced in previous commit
2009-02-03 Alexei SheplyakovImplement modular multivariate GCD (based on chinese...
2008-11-05 Alexei Sheplyakov[bugfix] integer_cra: check if arguments contain at...
2008-10-19 Alexei SheplyakovRewritten heuristic and PRS GCD for univariate polynomi...
2008-10-14 Alexei Sheplyakovpolynomial: introduce a helper function to divide polyn...
2008-10-14 Alexei Sheplyakovmod_gcd: naive hack to chose a 'good' prime (to speed...
2008-09-30 Alexei Sheplyakov[bugfix] remainder_in_ring: using exact division is...
2008-09-30 Alexei Sheplyakov[bugfix] normalize_in_ring: don't set the leading coeff...
2008-09-30 Jens VollingaMerge branch 'master' of git://ffmssmsc.jinr.ru:443...
2008-09-20 Alexei SheplyakovImplemented modular GCD algorithm for univariate polyno...