NP-completeness of knapsack and subset sum proven for max-plus and max-times matrix semigroups, with pseudo-polynomial and polynomial algorithms demonstrated.
On generic complexity of the subset sum problem for monoids and groups of integer matrices of order 2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On tropical knapsack-type problems
NP-completeness of knapsack and subset sum proven for max-plus and max-times matrix semigroups, with pseudo-polynomial and polynomial algorithms demonstrated.