Exhaustive search (k-OV Orthogonal Vectors)
Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == -")
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
-