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

Linear Algebra and Its Applications

Volumn 377, Issue 1-3, 2004, Pages 291-295

  Liang, Heng ^a   Bai, Fengshan ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

(0, 1) matrix; Permanent; Unbiased estimator; Upper bound

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; THEOREM PROVING;

UNBIASED ESTIMATORS;

MATRIX ALGEBRA;

EID: 0242303526     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2003.09.003     Document Type: Article

References (6)

1. Brégman L.M. Some properties of nonnegative matrices and their permanents. Soviet Math. Dokl. 14:1973;945-949.
2. Brualdi R.A., Ryser H.J. Combinatorial Matrix Theory. 1991;Cambridge University Press.
3. Minc H. Upper bound for permanents of. (0,1) -matrices Bull. Amer. Math. Soc. 69:1963;789-791.
4. Minc H. Permanents. Encyclopedia Math. Appl. 1978;6.
5. Rasmussen L.E. Appromimating the permanent: a simple approach. Random Structures Algorithms. 5:1994;349-361.
6. Valliant L. The complexity of computing the permanent. Theoret. Comput. Sci. 8:1979;189-201.