Pages that link to "Item:Q709358"
From MaRDI portal
The following pages link to Calculation of the permanent of a sparse positive matrix (Q709358):
Displaying 11 items.
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589) (← links)
- An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← links)
- Limit theorems for random permanents with exchangeable structure (Q1888330) (← links)
- Some results on certain generalized circulant matrices (Q2017613) (← links)
- A hybrid algorithm for computing permanents of sparse matrices (Q2369215) (← links)
- Efficient computation of the permanent of a sparse matrix (Q2740952) (← links)
- Approximation of the determinant of large sparse symmetric positive definite matrices (Q2784380) (← links)
- A load balancing strategy for parallel computation of sparse permanents. (Q2864488) (← links)
- Expressing polynomials as the permanent of low rank square matrices (Q2883553) (← links)
- Flexible manufacturing system selection using a combinatorial mathematics-based decision-making method (Q3055223) (← links)
- Fast Computation by Block Permanents of Cumulative Distribution Functions of Order Statistics from Several Populations (Q5494719) (← links)
