The Orthogonal Vectors Conjecture for Branching Programs and Formulas

In the Orthogonal Vectors (OV) problem, we wish to determine if there is an orthogonal pair of vectors among $n$ Boolean vectors $d$ dimensions. OV Conjecture (OVC) posits that OV requires $n^{2-o(1)}$ time to solve, for all $d=omega(log n)$. Assuming the OVC, optimal time lower bounds have been proved for many prominent problems $P$. ...More