Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
From MaRDI portal
Publication:999813
DOI10.1016/j.laa.2008.10.029zbMath1163.65022OpenAlexW2093282530WikidataQ59903048 ScholiaQ59903048MaRDI QIDQ999813
Publication date: 10 February 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.10.029
Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40) Matrices of integers (15B36)
Related Items (9)
The Hafnian master theorem ⋮ Computing the ball size of frequency permutations under Chebyshev distance ⋮ Coding for locality in reconstructing permutations ⋮ Inductive proof of Borchardt's theorem ⋮ An efficient tree decomposition method for permanents and mixed discriminants ⋮ On the permanents of circulant and degenerate Schur matrices ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ Some results on certain generalized circulant matrices ⋮ New permanent approximation inequalities via identities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Recurrence formulas for permanents of (0,1)-circulants
- Permanental compounds and permanents of (0,1)-circulants
- An exploration of the permanent-determinant method
- On the permanent of certain \((0,1)\) Toeplitz matrices
- The statistics of dimers on a lattice
- Quelques résultats dans la métrique des permutations
- Constrained Codes as Networks of Relations
- Dimer problem in statistical mechanics-an exact result
- Permanents
- Permanents of cyclic (0,1) matrices
- On the asymptotic eigenvalue distribution of Toeplitz matrices
This page was built for publication: Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
