On the permanent of certain \((0,1)\) Toeplitz matrices (Q1373310): Difference between revisions

Computation of the permanent of a matrix is a hard problem, much harder than computation of the determinant. It is very unlikely that a polynomial time algorithm exists. The authors describe briefly the history of this problem and then present their new contributions. They mainly study the special case of \((0,1)\) Toeplitz or circulant matrices with at most three nonzeroes in each row. The subject is related to graph theory. The paper is well organized and ends with conjectures and open questions. This is obviously a field in which much work remains to be done.