Fast Zeta Transforms for Lattices with Few Irreducibles
From MaRDI portal
Publication:4962203
DOI10.1145/2629429zbMath1398.68694OpenAlexW3160627641MaRDI QIDQ4962203
Mikko Koivisto, Andreas Björklund, Pekka Parviainen, Jesper Nederlof, Thore Husfeldt, Petteri Kaski
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2629429
latticefast multiplicationMöbius inversionarithmetic circuitsemigroup algebraMöbius transformzeta transform
Symbolic computation and algebraic computation (68W30) Representations of orders, lattices, algebras over commutative rings (16G30) Structure theory of lattices (06B05)
Related Items (7)
Focal points and their implications for Möbius transforms and Dempster-Shafer theory ⋮ Fast Algorithms for Join Operations on Tree Decompositions ⋮ Fast Möbius inversion in semimodular lattices and ER-labelable posets ⋮ Computing generalized convolutions faster than brute force ⋮ Efficient Möbius Transformations and Their Applications to D-S Theory ⋮ Unnamed Item ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces
This page was built for publication: Fast Zeta Transforms for Lattices with Few Irreducibles
