Pages that link to "Item:Q1360652"
From MaRDI portal
The following pages link to A fast computer algorithm for finding the permanent of adjacency matrices (Q1360652):
Displaying 5 items.
- The expected characteristic and permanental polynomials of the random Gram matrix (Q405292) (← links)
- 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)
- How fast can one compute the permanent of circulant matrices? (Q1124882) (← links)
- New algorithm for nonorthogonal ab initio valence bond calculations. II: Subgraph-driven method (Q1360590) (← links)