1 citations · 1 across the 3 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2012
Fast Computation of Smith Forms of Sparse Matrices Over Local Rings
Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin +1
We present algorithms to compute the Smith Normal Form of matrices over two families of local rings. The algorithms use the \emph{black-box} model which is suitable for sparse and…
cs.SC2010★ 1 cited
Gradual sub-lattice reduction and a new complexity for factoring polynomials
Mark Van Hoeij, Andrew Novocin
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type s…