arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.4567cs.SC
收藏

线性代数中的本质最优交互式证书

Essentially optimal interactive certificates in linear algebra

Jean-Guillaume Dumas, Erich Kaltofen

摘要:

线性代数计算的证书是每个输出的附加数据结构,可以由一个-可能是随机的-验证算法使用,该算法证明每个输出的正确性。如果验证的时间(和空间)复杂度在输入大小$N$中基本上是线性的,意味着$N$乘以因子$N^{o(1)}$,即,因子$N^{η(N)}$与$\lim\_{N\to \infty} η(N)$ $=$ $0$。我们给出了算法,计算基本上是最佳的证书的正半定性,Frobenius形式,特征和最小多项式的$n\times n$密集整数矩阵$A$。我们的证书可以在蒙特卡洛位复杂度$(n^2 \log\|A\|)^{1+o(1)}$中进行验证,其中$\log\|A\|$是整数条目的位大小,解决了[Kaltofen,Nehring,Saunders,Proc.\ ISSAC 2011],但须符合计算硬度假设。其次,我们给出了算法,计算证书的稀疏或结构化的$n\times n$矩阵的秩在一个抽象的字段,其Monte Carlo验证的复杂性是$2$矩阵倍矢量产品$+$ $n^{1+o(1)}$算术运算领域。例如,如果$n\times n$输入矩阵是稀疏的,具有$n^{1+o(1)}$非零条目,则可以在$n^{1+o(1)}$字段操作中验证我们的等级证书。这也扩展到仅具有额外$\|A\|^{1+o(1)}$因子的整数矩阵。我们所有的证书都是基于交互式验证协议,通过Fiat-Shamir识别启发式删除交互。我们的验证过程的有效性受到标准的计算硬度假设密码学。

英文摘要:

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^{η(N)}$ with $\lim\_{N\to \infty} η(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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑