Abboud, Williams, Yu (OV Orthogonal Vectors)
Jump to navigation
Jump to search
Time Complexity
$O(n^{({2}-{1}/O(d/log(n)))})$
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
Yes, Monte Carlo
Model of Computation
Word RAM
Year
2015
Reference
https://epubs-siam-org.ezproxy.canberra.edu.au/doi/abs/10.1137/1.9781611973730.17