Calculation of the permanent of a sparse positive matrix
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 3621932 (Why is no real title available?)
- scientific article; zbMATH DE number 1273990 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- scientific article; zbMATH DE number 3282537 (Why is no real title available?)
- A Method for Finding Permanents of 0, 1 Matrices
- A Monte-Carlo Algorithm for Estimating the Permanent
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- A mildly exponential approximation algorithm for the permanent
- A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices
- A permanent formula with many zero-valued terms
- An upper bound for the permanent of a nonnegative matrix
- Approximating the Permanent
- Computing mixed discriminants, mixed volumes, and permanents
- Methods for scaling to doubly stochastic form
- The complexity of computing the permanent
Cited in
(13)- Fast computation by block permanents of cumulative distribution functions of order statistics from several populations
- 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
- Belief propagation and loop calculus for the permanent of a non-negative matrix
- An efficient algorithm for computing permanental polynomials of graphs
- Improved algorithms for permanent and permanently polynomial of sparse graph
- 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
- 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)
