An algorithmic proof of Bregman-Minc theorem.

Bregman-Minc theorem gives the best known upper bound of the permanent of (0, 1)-matrices. A new proof of the theorem is presented in this paper, using an unbiased estimator of permanent [L.E. Rasmussen, Approximating the permanent: a simple approach, Random Structures Algorithms 5 (1994), p. 349]. This proof establishes a connection between the randomized approximate algorithm and the bound estimation for permanents. [ABSTRACT FROM AUTHOR]