Havas,Mauriski,Matthews LLL Hermite Normal Form算法的复杂性
Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form algorithm
摘要:
我们证明了HMM LLL HNF算法中的整数具有O(m.log(m.B))的位长,其中m是输入矩阵的行数,B是输入矩阵的行的最大平方长度。这仅仅比LLL算法中的估计O(m.log(B))差一点点。
英文摘要:
We show that the integers in the HMM LLL HNF algorithm have bit length O(m.log(m.B)), where m is the number of rows and B is the maximum square length of a row of the input matrix. This is only a little worse than the estimate O(m.log(B)) in the LLL algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。