Portal de Periódicos da CAPES

An upper bound for the permanent of (0,1)-matrices

2003; Elsevier BV; Volume: 377; Linguagem: Inglês

10.1016/j.laa.2003.09.003

1873-1856

Heng Liang, Fengshan Bai,

Complexity and Algorithms in Graphs

A novel upper bound for the permanent of (0,1)-matrices is obtained in this paper, by using an unbiased estimator of permanent [Random Structures Algorithms 5 (1994) 349]. It is a refinement of Minc's very famous result, and apparently tighter than the current best general bound in some cases.