Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025
The general knapsack problem is known to be NP-complete. In this paper a very special knapsack problem ia studied, namely, one with only two variables. A polynomial-time algorithm is presented and analyzed. However, it remains an open problem that for any fixed n > 2, the knapsack problem with n variables can be solved in polynomial time. © 1976, ACM. All rights reserved.
Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025
Rei Odaira, Jose G. Castanos, et al.
IISWC 2013
Seung Gu Kang, Jeff Weber, et al.
ACS Fall 2023
Jehanzeb Mirza, Leonid Karlinsky, et al.
NeurIPS 2023