scientific article; zbMATH DE number 1577997
From MaRDI portal
Publication:2704232
Recommendations
- How fast can one compute the permanent of circulant matrices?
- Computing sparse permanents faster
- Computation of sparse circulant permanents via determinants
- Computing permanents via determinants for some classes of sparse matrices
- Permanents of circulants: a transfer matrix approach (extended abstract)
Cited in
(19)- scientific article; zbMATH DE number 599403 (Why is no real title available?)
- On the permanent of certain submatrices of circulant \((0,1)\)-matrices
- scientific article; zbMATH DE number 4175157 (Why is no real title available?)
- Permanents of circulants: a transfer matrix approach (extended abstract)
- On the parity of permanents of circulant matrices
- Computing permanents via determinants for some classes of sparse matrices
- On very sparse circulant \((0,1)\) matrices
- On the number of different permanents of some sparse (0,1)-circulant matrices.
- Computation of sparse circulant permanents via determinants
- An extended tree-width notion for directed graphs related to the computation of permanents
- An extended tree-width notion for directed graphs related to the computation of permanents
- On the permanental polynomials of matrices
- scientific article; zbMATH DE number 1923149 (Why is no real title available?)
- On the values of permanents of (0, 1) circulant matrices with three ones per row
- How fast can one compute the permanent of circulant matrices?
- scientific article; zbMATH DE number 4029760 (Why is no real title available?)
- On the permanents of circulant and degenerate Schur matrices
- scientific article; zbMATH DE number 888945 (Why is no real title available?)
- Parameterized complexity of determinant and permanent
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2704232)
