TR00-079 | 12th September 2000 00:00
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
Abstract:
We present a fully-polynomial randomized approximation scheme
for computing the permanent of an arbitrary matrix
with non-negative entries.
