In the ORTHOGONAL VECTORS (OV) problem, we wish to determine if there is an orthogonal pair of vectors among n Boolean vectors in d dimensions. TheOV Conjecture (OVC) posits that OV requires n time to solve, for all d = ω(logn). Assuming the OVC, optimal time lower bounds have been proved for many prominent problems in P, such as Edit Distance, Frechet Distance, Longest Common Subsequence, and ...