摘要：The k-SUM problem is given n input real numbers to determine whether any k of them sum to zero. The problem is of tremendous importance in the emerging field of complexity theory within P, and it is in particular open whether it admits an algorithm of complexity O(n^c) with c
关键词：k-SUM problem; linear decision trees; point location; $varepsilon$-nets
