arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1311.0366cs.DScs.CCcs.DMmath.CO
收藏

关于格同构问题

On the Lattice Isomorphism Problem

Ishay Haviv, Oded Regev

摘要:

研究了格同构问题(LIP),其中给定两个格L_1和L_2,目标是判定是否存在L_1到L_2的正交线性变换映射。我们的主要结果是这个问题的一个算法运行在时间n^{O(n)}倍的多项式的输入大小,其中n是输入格的秩。一个重要的组成部分是一个新的广义隔离引理,它可以隔离Z^n的给定子集中的n个线性无关向量,并且可能在其他地方有用。我们还证明了LIP位于复杂性类SZK。

英文摘要:

We study the Lattice Isomorphism Problem (LIP), in which given two lattices L_1 and L_2 the goal is to decide whether there exists an orthogonal linear transformation mapping L_1 to L_2. Our main result is an algorithm for this problem running in time n^{O(n)} times a polynomial in the input size, where n is the rank of the input lattices. A crucial component is a new generalized isolation lemma, which can isolate n linearly independent vectors in a given subset of Z^n and might be useful elsewhere. We also prove that LIP lies in the complexity class SZK.

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

↑