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

@inproceedings{Liang2003AnUB,
  title={An upper bound for the permanent of ( 0 , 1 )-matrices},
  author={Heng Liang and Fengshan Bai},
  year={2003}
}
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. © 2003 Elsevier Inc. All rights reserved.