How fast can one compute the permanent of circulant matrices?
From MaRDI portal
Publication:1124882
DOI10.1016/S0024-3795(99)00012-9zbMATH Open0933.65045WikidataQ128153645 ScholiaQ128153645MaRDI QIDQ1124882FDOQ1124882
Authors: Bruno Codenotti, A. Bernasconi, Valentino Crespi, Giovanni Resta 
Publication date: 29 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
- Computing the permanent of (some) complex matrices
- How Fast are Nonsymmetric Matrix Iterations?
- scientific article; zbMATH DE number 1577997
- Efficient computation of the permanent of a sparse matrix
- A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices
- scientific article; zbMATH DE number 2067009
- Computation of sparse circulant permanents via determinants
- Fast and parallel algorithms for symmetric \(r\)-circulant matrices
- A fast computer algorithm for finding the permanent of adjacency matrices
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
Computational methods for sparse matrices (65F50) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)
Cited In (11)
- 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 the number of different permanents of some sparse (0,1)-circulant matrices.
- Computation of sparse circulant permanents via determinants
- Inductive proof of Borchardt's theorem
- On prime factors of determinants of circulant matrices
- On the values of permanents of (0, 1) circulant matrices with three ones per row
- Permanental compounds and permanents of (0,1)-circulants
- Title not available (Why is that?)
- An update on Minc's survey of open problems involving permanents
This page was built for publication: How fast can one compute the permanent of circulant matrices?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124882)
