A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices
From MaRDI portal
Publication:5956839
DOI10.1007/S00453-001-0072-0zbMath0995.68190OpenAlexW158671191MaRDI QIDQ5956839
Publication date: 28 February 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0072-0
Related Items (8)
A hybrid algorithm for computing permanents of sparse matrices ⋮ Computing the permanent modulo a prime power ⋮ Calculation of the permanent of a sparse positive matrix ⋮ An efficient algorithm for computing permanental polynomials of graphs ⋮ Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors ⋮ Computing sparse permanents faster ⋮ Unnamed Item ⋮ Faster exponential-time algorithms in graphs of bounded average degree
This page was built for publication: A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices
