We show that the permanent of an m x n rectan- gular matrix can be computed with O(n2~m + 3~m ) multiplications and additions. Asymptotically, this is better than straightfor- ward extensions of the best known algorithms for the permanent of a square matrix when m < log_32 and n→∞.
展开▼
机译：我们表明，可以通过O（n2〜m + 3〜m）乘法和加法来计算m x n矩形矩阵的永久性。渐近而言，这比m / n 展开▼
