Pages that link to "Item:Q5956839"

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):

Displayed 4 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)
• A hybrid algorithm for computing permanents of sparse matrices (Q2369215) ‎ (← links)