56 citations · 118 across the 19 of their papers we have counts for
Showing 2009 · cs.DSShow all
2 papers · 2 filters
cs.DS2009
On evaluation of permanents
Andreas Björklund, Thore Husfeldt, Petteri Kaski +1
We study the time and space complexity of matrix permanents over rings and semirings.
cs.DS2009★ 10 cited
Counting Paths and Packings in Halves
Andreas Björklund, Thore Husfeldt, Petteri Kaski +1
It is shown that one can count -edge paths in an -vertex graph and -set -packings on an -element universe, respectively, in time and ${n \choose mk…