Calculation of the permanent of a sparse positive matrix
DOI10.1016/S0010-4655(02)00683-5zbMATH Open1196.15010OpenAlexW2068110173MaRDI QIDQ709358FDOQ709358
Publication date: 18 October 2010
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0010-4655(02)00683-5
Recommendations
- Efficient computation of the permanent of a sparse matrix
- A hybrid algorithm for computing permanents of sparse matrices
- Improved algorithms for permanent and permanently polynomial of sparse graph
- Computing sparse permanents faster
- Computing permanents via determinants for some classes of sparse matrices
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Positive matrices and their generalizations; cones of matrices (15B48) Determinants, permanents, traces, other special matrix functions (15A15)
Cites Work
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- The complexity of computing the permanent
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing mixed discriminants, mixed volumes, and permanents
- An upper bound for the permanent of a nonnegative matrix
- Methods for scaling to doubly stochastic form
- A Method for Finding Permanents of 0, 1 Matrices
- A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices
Cited In (11)
- Expressing polynomials as the permanent of low rank square matrices
- Some results on certain generalized circulant matrices
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
- An efficient algorithm for computing permanental polynomials of graphs
- Limit theorems for random permanents with exchangeable structure
- A hybrid algorithm for computing permanents of sparse matrices
- Efficient computation of the permanent of a sparse matrix
- Fast Computation by Block Permanents of Cumulative Distribution Functions of Order Statistics from Several Populations
- Approximation of the determinant of large sparse symmetric positive definite matrices
- A load balancing strategy for parallel computation of sparse permanents.
- Flexible manufacturing system selection using a combinatorial mathematics-based decision-making method
This page was built for publication: Calculation of the permanent of a sparse positive matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709358)
