A permanent formula with many zero-valued terms

DOI10.1016/S0020-0190(97)00078-1zbMath1336.68114OpenAlexW2021032740MaRDI QIDQ287124

J. N. Franklin, Eric T. Bax

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00078-1

zbMATH Keywords

generating functioncombinatorial problemsfinite differencepermanent\#P

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Determinants, permanents, traces, other special matrix functions (15A15) Boolean and Hadamard matrices (15B34)

Related Items (6)

A permanent formula with many zero-valued terms ⋮ A hybrid algorithm for computing permanents of sparse matrices ⋮ Some upper bounds for permanents of (0, 1)-matrices ⋮ Efficient computation of the permanent of a sparse matrix ⋮ Calculation of the permanent of a sparse positive matrix ⋮ New permanent approximation inequalities via identities

Cites Work

• A permanent formula with many zero-valued terms
• The complexity of computing the permanent
• A finite-difference sieve to count paths and cycles by length
• A mildly exponential approximation algorithm for the permanent
• Approximating the Permanent
• A Monte-Carlo Algorithm for Estimating the Permanent
• Unnamed Item

This page was built for publication: A permanent formula with many zero-valued terms