In principle , exact recovery can be solved in its feasible range using maximum likelihood , but this amounts to solving a constrained or regularized cut problem such as minimum bisection that is typically NP-complete .