A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum

DOI10.46298/DMTCS.9877arXiv2208.00458OpenAlexW4308104425MaRDI QIDQ6045460

Luciano Margara

Publication date: 31 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.00458

zbMATH Keywords

heuristicsdecompositionpolynomialsmultisets

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integral Cayley multigraphs over abelian and Hamiltonian groups
• Factoring polynomials and the knapsack problem
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• Factoring polynomials with rational coefficients
• Sparse complex polynomials and polynomial reducibility
• A polynomial time algorithm for diophantine equations in one variable
• Towards tractable algebras for bags
• Factorizations of polynomials with integral non-negative coefficients
• Approximating multidimensional subset sum and Minkowski decomposition of polygons
• Approximate counting of regular hypergraphs
• On some classes of polynomials with nonnegative coefficients and a given factor
• Bounded-degree factors of lacunary multivariate polynomials
• `` Strong NP-Completeness Results
• Irreducibility of Polynomials
• Factors of disconnected graphs and polynomials with nonnegative integer coefficients
• Reducibility among Combinatorial Problems
• On the complexity of factoring bivariate supersparse (Lacunary) polynomials
• The NP-completeness column: An ongoing guide
• Decomposition of polytopes and polynomials

This page was built for publication: A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum