Some upper bounds for permanents of (0, 1)-matrices

References

• R. B. Bapat Permanent in probability and statistics Linear Algebra Appl 1990 127 3 25
   Web of Science ®Google Scholar
• E. Bax J. Franklin A permanent formula with many zero-valued terms Infor. Proc. Lett 1997 63 33 39
   Web of Science ®Google Scholar
• L. M. Bregman Certain properties of nonnegative matrices and their permanents Dokl. Akad. Nauk. SSSR 1973 211 27 30
   Google Scholar
• W. K. Chen Applied Graph Theory North-Holland Publishing Company New York 1976
   Google Scholar
• J. Donald H. Elwin R. Hager P. Salamon A graph theoretic upper bound on the permanent of a nonnegative integer matrix I Linear Algebra Appl 61 1984 187 198
   Google Scholar
• U. Feige L. Garsten On the hardness of computing the permanent of random matrices Comput. Complexity 6 1997 101 132
   Google Scholar
• S. G. Hwang Maximum permanents on certain classes of nonnegative matrices Linear Algebra Appl 132 1990 103 113
   Google Scholar
• S. G. Hwang A. R. Kruter T. S. Michael An upper bound of the permanent of a nonnegative matrix Linear Algebra Appl 281 1998 259 263
   Web of Science ®Google Scholar
• H. Jr. Marshall Combinatorial Theory John Wiley and Sons New York 1986
   Google Scholar
• H. Minc Upper bounds for permanents of 01 -matrices Bull. Amer. Math. Soc 69 1963 789 791
   Google Scholar
• H. J. Ryser Combinatorial Mathematics, John Wiley & Sons, Inc 1963
   Google Scholar
• S. Saluja A note on the permanent value problem Infor. Proc. Lett 43 1992 1 5
   Web of Science ®Google Scholar
• P. Spirakis J. Diaz M. J. Serna On the random generation and counting of matching in dense graphs Theoret. Comput. Sci 201 1998 281 290
   Google Scholar
• L. Thomas Algebraic Complexity Theory, Springer-Verglas, Berlin 1997
   Google Scholar
• L. G. Valiant The complexity of computing the permanent Theoret. Comput Sci 8 1979 189 201
   Google Scholar
• J. H. van Lint R. M. Wilson A Course in Combinatorics Cambridge University Press Cambridge 1992
   Google Scholar