Binary representation search with matrix multiplication (Unweighted Graph Diameter)
Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^omega log(V)$) where omega is the exponent on matrix multiplication == Space Complexity == $O(V^{2} logV)$ words (storing all the matrices) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == - == Reference == -")
Time Complexity
$O(V^omega log(V)$) where omega is the exponent on matrix multiplication
Space Complexity
$O(V^{2} logV)$ words
(storing all the matrices)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
-
Reference
-