https://deepai.org/publication/on-strong-np-completeness-of-rational-problems
On Strong NP-Completeness of Rational Problems | DeepAI
Feb 26, 2018 - 02/26/18 - The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems ...
strong np completenessrationalproblemsdeepai