We show that the k-SUM problem can be solved by a linear decision tree of depth O(n2 log2 n), improving the recent bound O(n3 log3 n) of Cardinal et al. . Our bound depends linearly on k, and allows us to conclude that the number of linear queries required to decide the n-dimensional KNAPSACK or SUBSETSUM problems is only O(n3 log n), improving the currently best known bounds by a factor of n [28, 29]. Our algorithm extends to the RAM model, showing that the k-SUM problem can be solved in expected polynomial time, for any fixed k, with the above bound on the number of linear queries. Our approach relies on a new point-location mechanism, exploiting "ϵ-cuttings" that are based on vertical decompositions in hyperplane arrangements in high dimensions. A major side result of the analysis in this paper is a sharper bound on the complexity of the vertical decomposition of such an arrangement (in terms of its dependence on the dimension). We hope that this study will reveal further structural properties of vertical decompositions in hyperplane arrangements.