An Equivalence Class for Orthogonal Vectors
The Orthogonal Vectors problem (OV) asks: given n vectors in {0, 1}O(log n), are two of them orthogonal? OV is easily solved in O(n2 log n) time, and it is a central problem in fine-grained complexity: dozens of conditional lower bounds are based on the popular hypothesis that OV cannot be solved in...
Main Authors: | Chen, Lijie, Williams, Richard Ryan |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Book |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics
2021
|
Online Access: | https://hdl.handle.net/1721.1/130333 |
Similar Items
-
The orthogonal vectors conjecture for branching programs and formulas
by: Kane, Daniel, et al.
Published: (2021) -
On the equivalence of dynamically orthogonal and bi-orthogonal methods: Theory and numerical simulations
by: Choi, Minseok, et al.
Published: (2016) -
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
by: Chan, Timothy M, et al.
Published: (2022) -
Orthogonal Vector Computations
by: Karl Svozil
Published: (2016-04-01) -
Relations and equivalences between circuit lower bounds and Karp-Lipton theorems
by: Williams, Richard Ryan, et al.
Published: (2021)