Questions tagged [complexity]
2 questions
9
votes
1 answer
How does one end up with a non-integer exponent in time complexity? (e.g., $O(n^{2.81})$)
Periodically I come across sentences like
"Winograd's variant [20] of this algorithm, whose asymptotic complexity is
also $O(n^{2.81})$ are considered" (from https://www.cise.ufl.edu/~sahni/papers/strassen.pdf)
I understand intuitively how we end…
Joe
- 192
- 5
2
votes
0 answers
What will be the complexity of the function having two input sizes?
What will be the complexities in the following case:
T(m,n) = T(m-1,n) + T(n-1,m) + O(m*n)
After a bit of searching I found that if I could make this function monotonic and then try to find the solution. But I am feeling that this is not the…
Sahil Babbar
- 21
- 3