| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428540 | Information Processing Letters | 2014 | 4 Pages |
Abstract
•We study evaluation of sums indexed by input sets that are disjoint from output sets.•For indices over all small subsets, we show a near-linear monotone complexity.•Applications include counting maximum-weight paths and rectangular matrix permanents.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev,