Pages that link to "Item:Q5956839"
From MaRDI portal
The following pages link to A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices (Q5956839):
Displaying 8 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)
- Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← links)
- A hybrid algorithm for computing permanents of sparse matrices (Q2369215) (← links)
- Computing the permanent modulo a prime power (Q2628281) (← links)
- Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors (Q5091174) (← links)
- (Q5743447) (← links)
