Skip to Main content Skip to Navigation
New interface
Conference papers

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix

Jean-Guillaume Dumas 1 Erich Kaltofen 2 Emmanuel Thomé 3 Gilles Villard 4, 5 
3 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
4 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Computational problem certificates are additional data structures for each output, which can be used by a—possibly randomized—verification algorithm that proves the correctness of each output. In this paper, we give an algorithm that computes a certificate for the minimal polynomial of sparse or structured n×n matrices over an abstract field, of sufficiently large cardinality, whose Monte Carlo verification complexity requires a single matrix-vector multiplication and a linear number of extra field operations. We also propose a novel preconditioner that ensures irreducibility of the characteristic polynomial of the generically preconditioned matrix. This preconditioner takes linear time to be applied and uses only two random entries. We then combine these two techniques to give algorithms that compute certificates for the determinant, and thus for the characteristic polynomial, whose Monte Carlo verification complexity is therefore also linear.
Document type :
Conference papers
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Jean-Guillaume Dumas Connect in order to contact the contributor
Submitted on : Wednesday, November 27, 2019 - 4:54:38 PM
Last modification on : Friday, November 18, 2022 - 9:27:15 AM
Long-term archiving on: : Friday, February 28, 2020 - 12:11:00 PM


Files produced by the author(s)



Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé, Gilles Villard. Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. ISSAC’2016, Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. pp.199-206, ⟨10.1145/2930889.2930908⟩. ⟨hal-01266041v3⟩



Record views


Files downloads