Parameterized Complexity of Factorization Problems
Abstract
We study the parameterized complexity of the following factorization problem: given elements a,a1, …, am of a monoid and a parameter k, can a be written as the product of at most (or exactly) k elements from a1, …, am. Several new upper bounds and fpt-equivalences with more restricted problems (subset sum and knapsack) are shown. Finally, some new upper bounds for variants of the parameterized change-making problems are shown.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.