Affiliation:
1. Shiv Kumar Singh Institute of Technology, Indore
Abstract
We present a deterministic algorithm, which, for any given 0 < s <1 and an n × n real or complex matrix A = (aij) such that |aij − 1| ≤ 0.19 for all i, j computes the permanent of A within relative error s in nO(lnn−lns) time. The method can be extended to computing hafnians and multidimensional permanents.