Back to Search
Start Over
An upper bound for the permanent of <f>(0,1)</f>-matrices
- Source :
-
Linear Algebra & its Applications . Jan2004, Vol. 377, p291. 5p. - Publication Year :
- 2004
-
Abstract
- A novel upper bound for the permanent of <f>(0,1)</f>-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. [Copyright &y& Elsevier]
- Subjects :
- *MATRICES (Mathematics)
*ALGORITHMS
*UNIVERSAL algebra
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 377
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 11295100
- Full Text :
- https://doi.org/10.1016/j.laa.2003.09.003