linbox
Bibliography

Class BlockLanczosSolver< Field, Matrix >
[Montgomery '95]

Class BlockMasseyDomain< _Field, _Sequence >
Giorgi, Jeannerod Villard algorithm from ISSAC'03

Class FullMultipCRA< Domain_Type >

Global GaussDomain< _Field >::QLUPin (unsigned long &rank, Element &determinant, Perm &Q, Matrix &L, Matrix &U, Perm &P, unsigned long Ni, unsigned long Nj) const

Class GivaroRnsFixedCRA< Domain_Type >

Global LinBox::cia (Polynomial &P, const Blackbox &A, const Method::BlasElimination &M)
[Dumas-Pernet-Wan ISSAC05]

Group padic

Global PID_integer::RationalReconstruction (Element &a, Element &b, const Element &f, const Element &m, const Element &k, bool reduce, bool recursive) const

File rational-solver2.h
Implementation of the algorithm in manuscript, available at http://www.cis.udel.edu/~wan/jsc_wan.ps

Class RationalSolver< Ring, Field, RandomPrime, BlockWiedemannTraits >

Class RationalSolver< Ring, Field, RandomPrime, DixonTraits >

Class RationalSolver< Ring, Field, RandomPrime, WanTraits >

Class RationalSolver< Ring, Field, RandomPrime, WiedemannTraits >

Class SigmaBasis< _Field >

Class SmithFormIliopoulos
Worst Case Complexity Bounds on Algorithms for computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix, by Costas Iliopoulos.