I believe we have to use a variant  of master theorem...can someone suggest me how to find complexity of such equation which doesn't directly fit into Masters theorem.
How to find complexity of T(n) = 8T(n/2)+n^2.93(log n)^93?
algorithms;algorithm analysis