Computation of sparse circulant permanents via determinants

DOI10.1016/S0024-3795(02)00330-0zbMath1017.65044MaRDI QIDQ1855364

Giovanni Resta, Bruno Codenotti

Publication date: 5 February 2003

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

zbMATH Keywords

determinantsgenuspermanentcirculant matricesperfect matchings

Mathematics Subject Classification ID

Numerical computation of determinants (65F40)

Related Items (15)

Computing permanents via determinants for some classes of sparse matrices ⋮ On very sparse circulant \((0,1)\) matrices ⋮ Recursive and combinational formulas for permanents of general k-tridiagonal Toeplitz matrices ⋮ Congruences for permanents and determinants of circulants ⋮ Circulant matrices and Galois-Togliatti systems ⋮ Inductive proof of Borchardt's theorem ⋮ On the number of different permanents of some sparse (0,1)-circulant matrices. ⋮ Characterizing Valiant's algebraic complexity classes ⋮ On the parity of permanents of circulant matrices ⋮ An update on Minc's survey of open problems involving permanents ⋮ The combinatorics of a three-line circulant determinant ⋮ Some results on certain generalized circulant matrices ⋮ On prime factors of determinants of circulant matrices ⋮ On the values of permanents of (0, 1) circulant matrices with three ones per row ⋮ Convertible andm-convertible matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Recurrence formulas for permanents of (0,1)-circulants
• Permanental compounds and permanents of (0,1)-circulants
• Matching theory
• How fast can one compute the permanent of circulant matrices?
• On the theory of Pfaffian orientations. I: Perfect matchings and permanents
• On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
• On the permanent of certain \((0,1)\) Toeplitz matrices
• Matchings in graphs on non-orientable surfaces
• The statistics of dimers on a lattice
• Combinatorial and topological approach to the 3D Ising model
• Exact solution of the Ising model on group lattices of genus g>1
• A Combinatorial Solution of the Two-Dimensional Ising Model
• Optimization via enumeration: A new algorithm for the max cut problem

This page was built for publication: Computation of sparse circulant permanents via determinants