A hybrid algorithm for computing permanents of sparse matrices
From MaRDI portal
Publication:2369215
DOI10.1016/j.amc.2004.11.020zbMath1137.65343OpenAlexW2140817317MaRDI QIDQ2369215
Heng Liang, Songqi Huang, Feng-Shan Bai
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.11.020
Related Items (3)
An efficient algorithm for computing permanental polynomials of graphs ⋮ Permanent Expansions and Distributions of Order Statistics in the INID Case ⋮ A load balancing strategy for parallel computation of sparse permanents
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A permanent formula with many zero-valued terms
- The complexity of computing the permanent
- Calculation of the permanent of a sparse positive matrix
- Approximating the permanent via importance sampling with application to the dimer covering problem
- The permanent of 0-1 matrices and Kallman's algorithm
- Minimizing multi-homogeneous Bézout numbers by a local search method
- Efficient computation of the permanent of a sparse matrix
- Approximating the Permanent
- A Method for Finding Permanents of 0, 1 Matrices
- A Monte-Carlo Algorithm for Estimating the Permanent
- Permanents
- A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)\) expected speedup for \(0-1\) matrices]
This page was built for publication: A hybrid algorithm for computing permanents of sparse matrices
