Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
- 1 February 2009
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 430 (4) , 1364-1374
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Holographic Algorithms (Extended Abstract)2004
- On the permanent of certain (0, 1) Toeplitz matricesLinear Algebra and its Applications, 1997
- Permanental compounds and permanents of (0, 1)-circulantsLinear Algebra and its Applications, 1987
- Recurrence formulas for permanents of (0, 1)-circulantsLinear Algebra and its Applications, 1985
- Completeness classes in algebra1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- On the asymptotic eigenvalue distribution of Toeplitz matricesIEEE Transactions on Information Theory, 1972
- Permanents of cyclic (0,1) matricesJournal of Combinatorial Theory, 1969
- The statistics of dimers on a latticePhysica, 1961
- Dimer problem in statistical mechanics-an exact resultPhilosophical Magazine, 1961