Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Inverse Problems of some Mathematical Programming Problems   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 determinning a KKT point of the non-convex
quadratic programming problem is polynomial. We then show that the inverse
problems of non-monotone linear complementarity problem are polynomial solvable
in some cases, and in another case is NP-hard. Therefore we solve an open
question raised by Heuberger on inverse NP-hard problems and prove that
CoNP=NP.

4
The categories of this paper are: cond-mat
23
The categories of this paper are: solv-int
20
The categories of this paper are: acc-phys
15
The categories of this paper are: nucl-ex
24
The categories of this paper are: dg-ga
29
The categories of this paper are: funct-an
17
The categories of this paper are: q-fin
21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
16
The categories of this paper are: stat
30
The categories of this paper are: q-alg
33
The categories of this paper are: plasm-ph
22
The categories of this paper are: chao-dyn
13
The categories of this paper are: quant-ph
37
The categories of this paper are: supr-con
12
The categories of this paper are: nucl-th