A permanent formula with many zero-valued terms

DOI10.1016/S0020-0190(97)00078-1zbMATH Open1336.68114OpenAlexW2021032740MaRDI QIDQ287124FDOQ287124

Authors: Eric Bax, Joel Franklin 

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

Recommendations

• The permanent of a square matrix
• Computing permanents via determinants for some classes of sparse matrices
• A Possible Permanent Formula
• Efficient computation of the permanent of a sparse matrix
• scientific article; zbMATH DE number 1383488

zbMATH Keywords

generating functionfinite differencecombinatorial problemspermanent\#P

Mathematics Subject Classification ID

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

Cites Work

• The complexity of computing the permanent
• Title not available (Why is that?)
• A mildly exponential approximation algorithm for the permanent
• A permanent formula with many zero-valued terms
• Approximating the Permanent
• A Monte-Carlo Algorithm for Estimating the Permanent
• A finite-difference sieve to count paths and cycles by length

Cited In (9)

• Calculation of the permanent of a sparse positive matrix
• A permanent formula with many zero-valued terms
• Computation of matrix permanent with automatic differentiation
• A Possible Permanent Formula
• A hybrid algorithm for computing permanents of sparse matrices
• Efficient computation of the permanent of a sparse matrix
• Title not available (Why is that?)
• Some upper bounds for permanents of (0, 1)-matrices
• New permanent approximation inequalities via identities

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287124)