Run time as a function of number of variables and number of constraints

Hi OSQP authors and the larger community,

Is there some complexity analysis out there that could relate the number of flops to the number of variables (N) and number of constraints (M) fed to the ADMM solver?

Looking for something simple, example O(N*M)

I’m sure the real answer is a lot more sensitive to the problem specification.

Many thanks!
Arsh