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

被引:11
作者
Liang, H [1 ]
Bai, FS [1 ]
机构
[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
permanent; (0,1)-matrix; upper bound; unbiased estimator;
D O I
10.1016/j.laa.2003.09.003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 Mine's very famous result, and apparently tighter than the current best general bound in some cases. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码:291 / 295
页数:5
相关论文
共 6 条
  • [1] [Anonymous], THEOR COMPUT SCI
  • [2] Bregman L.M., 1973, SOVIET MATH DOKL, V14, P945
  • [3] Brualdi R. A., 1991, COMBINATORIAL MATRIX, V39
  • [4] Minc H., 1963, B AM MATH SOC, V69, P789, DOI DOI 10.1090/S0002-9904-1963-11031-9
  • [5] Minc H., 1978, PERMANENTS ENCY MATH, V6
  • [6] APPROXIMATING THE PERMANENT - A SIMPLE APPROACH
    RASMUSSEN, LE
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (02) : 349 - 361