Pages that link to "Item:Q2369215"
From MaRDI portal
The following pages link to A hybrid algorithm for computing permanents of sparse matrices (Q2369215):
Displaying 4 items.
- An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← 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)
