Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
From MaRDI portal
(Redirected from Publication:999813)
Recommendations
- The Hafnian of Toeplitz matrices of special type, perfect matchings and Bessel polynomials
- Efficient computation of the permanent of a sparse matrix
- Computing the permanent of (some) complex matrices
- Computation of sparse circulant permanents via determinants
- On the permanent of certain (0,1) Toeplitz matrices
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 1493053 (Why is no real title available?)
- scientific article; zbMATH DE number 825098 (Why is no real title available?)
- scientific article; zbMATH DE number 3311855 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- An exploration of the permanent-determinant method
- Combinatorial matrix theory
- Constrained Codes as Networks of Relations
- Dimer problem in statistical mechanics-an exact result
- Metrics on permutations, a survey
- On the asymptotic eigenvalue distribution of Toeplitz matrices
- On the permanent of certain (0,1) Toeplitz matrices
- Permanental compounds and permanents of (0,1)-circulants
- Permanents
- Permanents of cyclic (0,1) matrices
- Quelques résultats dans la métrique des permutations
- Recurrence formulas for permanents of (0,1)-circulants
- The complexity of computing the permanent
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(11)- Some results on certain generalized circulant matrices
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Computing the ball size of frequency permutations under Chebyshev distance
- Coding for locality in reconstructing permutations
- The Hafnian of Toeplitz matrices of special type, perfect matchings and Bessel polynomials
- Inductive proof of Borchardt's theorem
- The Hafnian master theorem
- New permanent approximation inequalities via identities
- Enumeration of even and odd chord diagrams
- On the permanents of circulant and degenerate Schur matrices
- An efficient tree decomposition method for permanents and mixed discriminants
This page was built for publication: Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999813)