A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries.

Mark Jerrum Alistair Sinclair Eric Vigoda

Published in: STOC (2001)

Keyphrases

polynomial time approximation
learning algorithm
np hard
optimal solution
theoretical analysis
dynamic programming
worst case
simulated annealing
error bounds
computational complexity
special case
detection algorithm
linear programming
constraint satisfaction
knapsack problem