Before revision:  The computational complexity is O\left( n^{15{2}}\right) , although very conservative, it is sufficient to prove that this minimization problem is in the  class P.
After revision:  The computational complexity is O\left( n^{15{2}}\right) , although very conservative, it is sufficient to prove that this minimization problem is in the complexity class P.