# Computing the permanent of (some) complex matrices

arXiv: https://arxiv.org/abs/1405.1303 · HTML: https://mlsanity.com/paper/1405.1303/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 May 2014.

## Built on by (most cited first, 1 of 1)

- [Parallel Sampling via Autospeculation](https://mlsanity.com/paper/2511.07869/) (2025)

## Abstract (arXiv)

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.