What is the computional complexity of SOCP problem?

If a SOCP problem is loaded by CVX, and the parameters are listed as:

variables:
totally have A scalar variables
, and B (M*N matrix) variable

cone constraints:
C constraints.

So what is the computational complexity of this problem?
Thanks for your attention!

You can take a look at

Very thanks for your reply.
I’ve figured out from it