Sciweavers

SODA
2008
ACM
122views Algorithms» more  SODA 2008»
14 years 1 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law