2000 character limit reached
Computing the permanent of (some) complex matrices (1405.1303v2)
Published 6 May 2014 in math.CO, cs.DS, math-ph, math.MP, and math.OC
Abstract: We present a deterministic algorithm, which, for any given 0< epsilon < 1 and an nxn real or complex matrix A=(a_{ij}) such that | a_{ij}-1| < 0.19 for all i, j computes the permanent of A within relative error epsilon in n{O(ln n -ln epsilon)} time. The method can be extended to computing hafnians and multidimensional permanents.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.