等价问题的复杂性类再探
Complexity Classes of Equivalence Problems Revisited
摘要:
为了确定两个数字列表是否是同一个集合,我们对两个列表进行排序,看看是否得到相同的结果。排序列表是集合相等的等价关系的标准形式。其他标准形式出现在图同构算法中,以及由生成元给出的置换群的相等性。然而,为了确定两个图是否是共谱的(具有相同的特征值),我们计算它们的特征多项式,看看它们是否相同;特征多项式是共谱等价关系的完全不变量。这是弱于一个标准形式,它是不知道是否存在一个多项式时间的标准形式的共谱。请注意,一个等价关系在多项式时间内是可判定的,而不需要一个完整的不变量或标准形式,这是先验可能的。Blass和Gurevich(SIAM J. Comput.,1984)问是否这些条件的等价关系-有一个FP标准形式,有一个FP完全不变量,只是在P -实际上是不同的。他们表明,这个问题需要非相对化技术来解决。在这里,我们扩展了他们的结果,并给出了新的连接概率和量子计算。
英文摘要:
To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism algorithms, and the equality of permutation groups given by generators. To determine if two graphs are cospectral (have the same eigenvalues), however, we compute their characteristic polynomials and see if they are the same; the characteristic polynomial is a complete invariant for the equivalence relation of cospectrality. This is weaker than a canonical form, and it is not known whether a polynomial-time canonical form for cospectrality exists. Note that it is a priori possible for an equivalence relation to be decidable in polynomial time without either a complete invariant or canonical form. Blass and Gurevich (SIAM J. Comput., 1984) ask whether these conditions on equivalence relations -- having an FP canonical form, having an FP complete invariant, and simply being in P -- are in fact different. They showed that this question requires non-relativizing techniques to resolve. Here we extend their results, and give new connections to probabilistic and quantum computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。