Exhaustive search (k-OV Orthogonal Vectors)
Jump to navigation
Jump to search
Time Complexity
$O(d*n^k)$
Space Complexity
$O(k)$ auxiliary words
(keeping track of which vectors we're looking at)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
-
Reference
-