Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems

TL;DR

A new algorithm is given which improves the average-case version of the Orthogonal Vectors problem to n^{2 - \Omega(\log\log c /\log c)}$ in the average case for any parameter p, using the polynomial method.

Abstract

We study the average-case version of the Orthogonal Vectors problem, in which one is given as input $n$ vectors from $\{0,1\}^d$ which are chosen randomly so that each coordinate is $1$ independently with probability $p$. Kane and Williams [ITCS 2019] showed how to solve this problem in time $O(n^{2 - δ_p})$ for a constant $δ_p > 0$ that depends only on $p$. However, it was previously unclear how to solve the problem faster in the hardest parameter regime where $p$ may depend on $d$. The best prior algorithm was the best worst-case algorithm by Abboud, Williams and Yu [SODA 2014], which in dimension $d = c \cdot \log n$, solves the problem in time $n^{2 - Ω(1/\log c)}$. In this paper, we give a new algorithm which improves this to $n^{2 - Ω(\log\log c /\log c)}$ in the average case for any parameter $p$. As in the prior work, our algorithm uses the polynomial method. We make use of a very simple polynomial over the reals, and use a new method to analyze its performance based on computing how its value degrades as the input vectors get farther from orthogonal. To demonstrate the generality of our approach, we also solve the average-case version of the closest pair problem in the same running time.

Theorems & Definitions (10)

• Conjecture 1.1: OV Conjecture
• Definition 1.2: $\mathop{\mathrm{\bf OV}}\limits(p)_{n,d}$
• Theorem 1.3
• Definition 1.4: $\mathop{\mathrm{\bf CP}}\limits_{n,d}$
• Theorem 1.5
• Lemma 2.1: The Chernoff bound
• Lemma 2.2: Fast Polynomial Evaluation williams2014faster
• Lemma 2.3
• Lemma 3.1: Closest pair version
• proof