Pages that link to "Item:Q1971539"
From MaRDI portal
The following pages link to The permanent of 0-1 matrices and Kallman's algorithm (Q1971539):
Displaying 10 items.
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589) (← links)
- A fast computer algorithm for finding the permanent of adjacency matrices (Q1360652) (← links)
- A hybrid algorithm for computing permanents of sparse matrices (Q2369215) (← links)
- Euler's difference table and maximum permanents of (0, 1)-matrices (Q2393526) (← links)
- Efficient computation of the permanent of a sparse matrix (Q2740952) (← links)
- A load balancing strategy for parallel computation of sparse permanents. (Q2864488) (← links)
- (Q3025281) (← links)
- (Q4222570) (← links)
- Polynomial algorithms for computing the permanents of some matrices (Q4522739) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465859) (← links)