1 paper
Siming Huang
The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of d…