Chan, Williams (OV Orthogonal Vectors)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{({2}-{1}/O(d/log(n)))})$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2016

Reference

https://epubs.siam.org/doi/abs/10.1137/1.9781611974331.ch87