2的平行多项式永久模幂与最短不交圈
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles
摘要:
本文提出了一种求一元整数多项式矩阵模2^k积和的并行算法。它将问题置于NC ^2的ParityL子集中。这扩展了技术[勇敢],[Braverman,Kulkarni,罗伊]和[Björklund,Husfeldt],并产生了一个(随机)并行算法最短的2-不相交路径改善后,最近的结果从(随机)多项式时间。我们还认识到不相交的路径问题作为一个特殊的情况下,找到不相交的周期,并提出(随机)并行算法,找到一个最短的周期和最短的2-不相交的周期通过任何给定的固定数量的顶点或边缘。
英文摘要:
We present a parallel algorithm for permanent mod 2^k of a matrix of univariate integer polynomials. It places the problem in ParityL subset of NC^2. This extends the techniques of [Valiant], [Braverman, Kulkarni, Roy] and [Björklund, Husfeldt], and yields a (randomized) parallel algorithm for shortest 2-disjoint paths improving upon the recent result from (randomized) polynomial time. We also recognize the disjoint paths problem as a special case of finding disjoint cycles, and present (randomized) parallel algorithms for finding a shortest cycle and shortest 2-disjoint cycles passing through any given fixed number of vertices or edges.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。