Some algorithmic results for [2]-sumset covers

DOI10.1016/j.ipl.2014.07.008zbMath1366.68088OpenAlexW2149527532MaRDI QIDQ458372

Romeo Rizzi, Stéphane Vialette, Laurent Bulteau, Guillaume Fertin

Publication date: 7 October 2014

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

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

zbMATH Keywords

complexityalgorithmsumset cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Optimal monomial quadratization for ODE systems

Cites Work

• Nonnegative integral subset representations of integer sets
• The minimum substring cover problem
• Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
• On the representation of 1,2,..., n by sums
• A Postage Stamp Problem
• On Finding Small 2-Generating Sets
• Representing powers of numbers as subset sums of small sets
• On optimal subset representations of integer sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some algorithmic results for [2]-sumset covers