无匹配门的全息算法
Holographic algorithms without matchgates
摘要:
全息算法的理论,这是多项式时间算法的某些组合计数问题,产生洞察复杂性类的层次结构。特别是,该理论产生的代数测试的问题是在类P.在这篇文章中,我们简化了实施全息算法,消除了一个步骤中的建设过程,并概括其适用于新的签名。而不是匹配门,这是加权图片段,取代顶点的自然二分图G关联到一个问题P,我们的方法只使用一个自然数的边缘数的边缘矩阵关联到G。一个容易计算的Pfweian的倍数是计数问题的解的数量。这种简化提高了我们对全息算法的适用性的理解,表明复杂性类的几何方法,并促进实际实现。广义的适用性,因为我们的方法允许新的代数测试,是不同的“格拉斯曼-Plucker身份”使用到现在。自然问题的治疗,这些新的方法已经被认为是以前在不同的背景下,我们提出了这样一个例子。
英文摘要:
The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, yields insight into the hierarchy of complexity classes. In particular, the theory produces algebraic tests for a problem to be in the class P. In this article we streamline the implementation of holographic algorithms by eliminating one of the steps in the construction procedure, and generalize their applicability to new signatures. Instead of matchgates, which are weighted graph fragments that replace vertices of a natural bipartite graph G associated to a problem P, our approach uses only only a natural number-of-edges by number-of-edges matrix associated to G. An easy-to-compute multiple of its Pfaffian is the number of solutions to the counting problem. This simplification improves our understanding of the applicability of holographic algorithms, indicates a more geometric approach to complexity classes, and facilitates practical implementations. The generalized applicability arises because our approach allows for new algebraic tests that are different from the "Grassmann-Plucker identities" used up until now. Natural problems treatable by these new methods have been previously considered in a different context, and we present one such example.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。