Andreas Björklund

most citedCounting Paths and Packings in Halves

10 citations · 10 across the 2 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

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 $k$ -edge paths in an $n$ -vertex graph and $m$ -set $k$ -packings on an $n$ -element universe, respectively, in time $(k /2 n)$ and ${n \choose mk…