Reduction to Chan, Williams (k-OV Orthogonal Vectors)
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