{"version":"1.0","type":"link","title":"Orthogonal vectors problem - Newikis","description":"In computational complexity theory, the Orthogonal Vectors (OV) problem is a fundamental problem that is used to prove conditional lower bounds under the assumption that the Strong Exponential Time Hypothesis (SETH) holds. OV is often used as an intermediate problem in fine grained reductions,…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}