Work

Parameterized Complexity of Factorization Problems

Year: 2025

Type: article

Abstract: We study the parameterized complexity of the following factorization problem: given elements $a,a_1, \ldots, a_m$ of a monoid and a parameter $k$, can $a$ be written as the product of at most (or exactly) $k$ elements from $a_1, \ldots, a_m$. 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.

Source: Discrete Mathematics & Theoretical Computer Science

DOI: 10.46298/dmtcs.13087

Authors: Markus Lohrey, Andreas Rosowski

Institution: University of Siegen

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Deutsche Forschungsgemeinschaft

Award: G4522827157