Computing sparse permanents faster
From MaRDI portal
Publication:1044712
DOI10.1016/j.ipl.2005.06.007zbMath1184.68625MaRDI QIDQ1044712
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.06.007
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W20: Randomized algorithms
Related Items
Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors, Unnamed Item, Faster exponential-time algorithms in graphs of bounded average degree
Cites Work