scientific article; zbMATH DE number 1577997
From MaRDI portal
Publication:2704232
zbMATH Open0968.65027MaRDI QIDQ2704232FDOQ2704232
Authors: Bruno Codenotti, Giovanni Resta 
Publication date: 20 September 2001
Title of this publication is not available (Why is that?)
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)
determinantpermanentcirculant graphpolynomial time algorithmalgebraic complexity\((0,1)\)-circulant matricessparse circulants
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Complexity and performance of numerical algorithms (65Y20) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)
Cited In (19)
- Title not available (Why is that?)
- On the permanent of certain submatrices of circulant \((0,1)\)-matrices
- Permanents of circulants: a transfer matrix approach (extended abstract)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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?
- Title not available (Why is that?)
- On the permanents of circulant and degenerate Schur matrices
- Title not available (Why is that?)
- 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)
