1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CR2016
A modified block Lanczos algorithm with fewer vectors
Emmanuel Thomé
The block Lanczos algorithm proposed by Peter Montgomery is an efficient means to tackle the sparse linear algebra problem which arises in the context of the number field sieve fac…
cs.SC2015★ 1 cited
Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices
Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé
Certificates to a linear algebra computation are additional data structures for each output, which can be used by a-possibly randomized- verification algorithm that proves the corr…