Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > OV:
Reports tagged with OV:
TR26-121 | 15th July 2026
Tameem Choudhury, Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan

New and Improved Concrete Lower Bounds for Orthogonal Vectors

The Orthogonal Vectors Problem (OV$_{n,d}$) takes as input two sets $A,B$ each containing $n$ $d$-dimensional Boolean vectors, and outputs $1$ if and only if there exists $a \in A$ and $b \in B$ such that $a$ and $b$ are orthogonal. The OV conjecture states that for every $\varepsilon > 0$, ... more >>>




ISSN 1433-8092 | Imprint