On complexity of computing the permanent of a rectangular matrix

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E82-A, Issue 5, 1999, Pages 741-744

  Kawabata, Tsutomu ^a   Tahiti, Jun ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Computational complexity; Differential operator on circuits; Permanent

Indexed keywords

MATHEMATICAL OPERATORS; MATRIX ALGEBRA; PROBLEM SOLVING; THEOREM PROVING;

RECTANGULAR MATRIX;

COMPUTATIONAL COMPLEXITY;

EID: 0032642695     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. L. Valiant, The complexity of computing the permanent," Theoret. Comput. Sei., vol.8, pp.189-201, 1979.
2. A. Sinclair, Algorithms for Random Generation and Counting," Birkhäuser, 1993.
3. G. Kogan, Computing permanents over fields of characteristic 3: Where and why it becomes difficult," Proc. 37th Annual Symposium on Foundations of Computer Science, pp.108-114, IEEE Computer Society Press, 1996.
4. L. Baum and J. Eagon, An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model of ecology," Bull. Amer. Math. Soc., vol.73, pp.360-363, 19G7.
5. J.H. van Lint and R.M. Wilson, A Course in Combinatorics," Cambridge University Press, 1992.
6. D.E. Knuth, The Art of Computer Programming, vol.2 Semi-numerical Algorithms," Addison-Wesley, 1969.
7. W. Feller, An Introduction to Probability Theory and its Applications I," John Wiley & Sons, 1957.
8. H. Mine, Nonnegative Matrices," John Wiley & Sons, 1988.
9. H. Mine, Permanents," Addison-Wesley, 1978.
10. R. Graham, D. Knuth, and O. Patashnik, Concrete Mathematics," Addison-Wesley, 1989.