Abboud, Williams, Yu (OV Orthogonal Vectors): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== 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/doi/abs/10.1137/1.9781611973730.17") |
(No difference)
|
Latest revision as of 12:18, 15 February 2023
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