Pages that link to "Item:Q1044712"

The following pages link to Computing sparse permanents faster (Q1044712):

Displaying 13 items.

• Computing the permanent of (some) complex matrices (Q285430) (← links)
• Calculation of the permanent of a sparse positive matrix (Q709358) (← links)
• Computing permanents via determinants for some classes of sparse matrices (Q852624) (← links)
• Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
• On the hardness of computing the permanent of random matrices (Q1355377) (← links)
• Faster exponential-time algorithms in graphs of bounded average degree (Q2347799) (← links)
• A hybrid algorithm for computing permanents of sparse matrices (Q2369215) (← links)
• Expressing polynomials as the permanent of low rank square matrices (Q2883553) (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
• Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors (Q5091174) (← links)
• Below all subsets for some permutational counting problems (Q5369519) (← links)
• (Q5743447) (← links)
• A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices (Q5956839) (← links)