Reduction to Chan, Williams (k-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^{(k-{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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{(k-{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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Reduction_to_Chan,_Williams_(k-OV_Orthogonal_Vectors)&oldid=45701"