Fast Multi-Subset Transform and Weighted Sums Over Acyclic Digraphs

02/19/2020
by   Mikko Koivisto, et al.
0

The zeta and Moebius transforms over the subset lattice of n elements and the so-called subset convolution are examples of unary and binary operations on set functions. While their direct computation requires O(3^n) arithmetic operations, less naive algorithms only use 2^n poly(n) operations, nearly linear in the input size. Here, we investigate a related n-ary operation that takes n set functions as input and maps them to a new set function. This operation, we call multi-subset transform, is the core ingredient in the known inclusion–exclusion recurrence for weighted sums over acyclic digraphs, which extends Robinson's recurrence for the number of labelled acyclic digraphs. Prior to this work the best known complexity bound was the direct O(3^n). By reducing the task to multiple instances of rectangular matrix multiplication, we improve the complexity to O(2.985^n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/30/2023

The Essential Algorithms for the Matrix Chain

For a given product of n matrices, the matrix chain multiplication probl...
research
04/30/2015

Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication

We describe a matrix multiplication recognition algorithm for a subset o...
research
06/25/2020

Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication

Boolean circuits of McCulloch-Pitts threshold gates are a classic model ...
research
11/20/2018

A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces

We propose a probabilistic Las Vegas variant of Brill-Noether's algorith...
research
10/12/2020

A Refined Laser Method and Faster Matrix Multiplication

The complexity of matrix multiplication is measured in terms of ω, the s...
research
01/03/2018

Computational complexity lower bounds of certain discrete Radon transform approximations

For the computational model where only additions are allowed, the Ω(n^2 ...
research
11/24/2022

Fast Möbius and Zeta Transforms

Möbius inversion of functions on partially ordered sets (posets) 𝒫 is a ...

Please sign up or login with your details

Forgot password? Click here to reset