In \crefsec:MK, we gave an O(N+a0.5λ0.5logA)-time algorithm for the Multichoice Knapsack problem.
Improvement of either exponent to 0.5−ε would result in a breakthrough for the Subset Sum and 3-Sum problems,
respectively.
Nevertheless, this does not…