Computing the permanent of (some) complex matrices
Abstract
We present a deterministic algorithm, which, for any given 0< epsilon < 1 and an nxn real or complex matrix A=(aij) such that | aij-1| < 0.19 for all i, j computes the permanent of A within relative error epsilon in nO(ln n -ln epsilon) time. The method can be extended to computing hafnians and multidimensional permanents.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.