Fast monotone summation over disjoint sets

DOI10.1016/j.ipl.2013.12.003zbMath1452.68088OpenAlexW2090224417MaRDI QIDQ2446070

Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev

Publication date: 15 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.12.003

zbMATH Keywords

algorithmscommutative semigrouparithmetic complexity\(k\)-pathmatrix permanentdisjoint summation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evaluation of permanents in rings and semirings
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Fourier meets M\"{o}bius: fast subset convolution
• Limits and Applications of Group Algebras for Parameterized Problems
• Counting Paths and Packings in Halves
• On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them
• Computational aspects of the Mobius transformation of graphs
• Negation is Powerless for Boolean Slice Functions
• Fast Monotone Summation over Disjoint Sets
• Finding, minimizing, and counting weighted subgraphs
• Multiplying matrices faster than coppersmith-winograd

This page was built for publication: Fast monotone summation over disjoint sets