Pages that link to "Item:Q2369215"

The following pages link to A hybrid algorithm for computing permanents of sparse matrices (Q2369215):

Displaying 10 items.

• Calculation of the permanent of a sparse positive matrix (Q709358) (← links)
• An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← links)
• Computing sparse permanents faster (Q1044712) (← links)
• A fast computer algorithm for finding the permanent of adjacency matrices (Q1360652) (← links)
• The permanent of 0-1 matrices and Kallman's algorithm (Q1971539) (← links)
• Efficient computation of the permanent of a sparse matrix (Q2740952) (← links)
• A load balancing strategy for parallel computation of sparse permanents. (Q2864488) (← links)
• Permanent Expansions and Distributions of Order Statistics in the INID Case (Q3391852) (← links)
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices (Q4702235) (← links)
• A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices (Q5956839) (← links)