Abboud, Williams, Yu (OV Orthogonal Vectors)

From Algorithm Wiki

Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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/doi/abs/10.1137/1.9781611973730.17

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Abboud,_Williams,_Yu_(OV_Orthogonal_Vectors)&oldid=45699"