Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product)
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == O*( \min \{n^{1/3} L^{17/{3}0}, n^{1.5} L^{1/4}\}) == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == Yes, == Model of Computation == Quantum == Year == 2018 == Reference == https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 1.6")
Time Complexity
O*( \min \{n^{1/3} L^{17/{3}0}, n^{1.5} L^{1/4}\})
Space Complexity
()
Description
Approximate?
Exact
Randomized?
Yes,
Model of Computation
Quantum
Year
2018
Reference
https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 1.6