I need to compute the computational complexity in big-O notation of the following double nested loop,
Let S={1,2,...,N}, T={1,2,...,M} then we have summation of two variable J and K on these sets as
$$\sum_{m=1}^{M} \sum_{n=1}^{N} (J_{n,k}K_{n,k})_m \quad \forall k \in S$$
The variable k is defined for all values on set S
The issue here is that we do not sum on variable k which is troublesome to me.
Any help is appreciated!
Thanks,