How fast can one compute the permanent of circulant matrices?

DOI10.1016/S0024-3795(99)00012-9zbMath0933.65045WikidataQ128153645 ScholiaQ128153645MaRDI QIDQ1124882

Bruno Codenotti, Anna Bernasconi, Giovanni Resta, Valentino Crespi

Publication date: 29 November 1999

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmsparse matricespermanentscirculant matrices\((0,1)\)-circulants

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)

Related Items (7)

Inductive proof of Borchardt's theorem ⋮ On the number of different permanents of some sparse (0,1)-circulant matrices. ⋮ On the parity of permanents of circulant matrices ⋮ An update on Minc's survey of open problems involving permanents ⋮ On prime factors of determinants of circulant matrices ⋮ On the values of permanents of (0, 1) circulant matrices with three ones per row ⋮ Computation of sparse circulant permanents via determinants

This page was built for publication: How fast can one compute the permanent of circulant matrices?