Essentially optimal interactive certificates in linear algebra - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

## Essentially optimal interactive certificates in linear algebra

Jean-Guillaume Dumas
Erich Kaltofen
• Function : Author
• PersonId : 874284

#### Abstract

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 correctness of each output. The certificates are essentially optimal if the time (and space) complexity of verification is essentially linear in the input size $N$, meaning $N$ times a factor $N^{o(1)}$, i.e., a factor $N^{\eta(N)}$ with $\lim_{N\to \infty} \eta(N)$ $=$ $0$. We give algorithms that compute essentially optimal certificates for the positive semidefiniteness, Frobenius form, characteristic and minimal polynomial of an $n\times n$ dense integer matrix $A$. Our certificates can be verified in Monte-Carlo bit complexity $(n^2 \log\|A\|)^{1+o(1)}$, where $\log\|A\|$ is the bit size of the integer entries, solving an open problem in [Kaltofen, Nehring, Saunders, Proc.\ ISSAC 2011] subject to computational hardness assumptions. Second, we give algorithms that compute certificates for the rank of sparse or structured $n\times n$ matrices over an abstract field, whose Monte Carlo verification complexity is $2$ matrix-times-vector products $+$ $n^{1+o(1)}$ arithmetic operations in the field. For example, if the $n\times n$ input matrix is sparse with $n^{1+o(1)}$ non-zero entries, our rank certificate can be verified in $n^{1+o(1)}$ field operations. This extends also to integer matrices with only an extra $\|A\|^{1+o(1)}$ factor. All our certificates are based on interactive verification protocols with the interaction removed by a Fiat-Shamir identification heuristic. The validity of our verification procedure is subject to standard computational hardness assumptions from cryptography.

#### Domains

Computer Science [cs] Symbolic Computation [cs.SC]

### Dates and versions

hal-00932846 , version 1 (17-01-2014)
hal-00932846 , version 2 (26-04-2014)
hal-00932846 , version 3 (12-12-2019)
hal-00932846 , version 4 (24-12-2019)

### Identifiers

• HAL Id : hal-00932846 , version 4
• ARXIV :
• DOI :

### Cite

Jean-Guillaume Dumas, Erich Kaltofen. Essentially optimal interactive certificates in linear algebra. ACM International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), Jul 2014, Kobe, Japan. pp.146-153, ⟨10.1145/2608628.2608644⟩. ⟨hal-00932846v4⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

668 View