#### Filter Results:

#### Publication Year

2015

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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 2. Inspired by an algorithm due to Meiser (1993), we show that there exist… (More)

In the k-SUM problem, we are given n real numbers as input, and we are asked whether there exists a zero-sum k-subset. The problem is of tremendous importance in complexity theory, and it is in particular open whether it admits an algorithm of complexity O(n c) with c < ⌈k/2⌉. Revisiting a known algorithm due to Meiser (1993), we show that there exist… (More)

- ‹
- 1
- ›