Given two lists $\{a_i\}_{i \in [n]}$ and $\{b_i\}_{i \in [n]}$ of vectors $a_i, b_i \in \{0,1\}^d$ and an integer $r \in \{0, \ldots, d\}$, is there a pair $a_i, b_j$ that has \sum_{h=1}^d a_i[h] \dot b_j[h] \leq r$