In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size k × k with non-negative entries over the max-plus algebra and the semigroup of square matrices of size k × k with positive entries over the max-times algebra. We prove that the knapsack problem and the subset sum problem for these structures are 𝖭𝖯-complete. We demonstrate that there are pseudo-polynomial algorithms to solve these problems. Also, we show that for the latter semigroup, there are polynomial generic algorithms to solve the knapsack problem and the subset sum problem.
Buchinskiy et al. (Fri,) studied this question.