Abstract
We investigate a large class of NP optimization problems which we call MNP. We show that Rmax(2) [PR] are in our class and some problems which are not likely in Rmax(2) are in our class. We also define a new kind of reductions, WL-reductions, to preserve approximability and unapproximability, so it is more general version of L-reductions[PY] and A-reductions [PR]. Then we show some complete problems of this class under WL-reductions and prove that the maxclique problem is one of them. So all complete problems in this class are as difficult to approximate as the max-clique problem.KeywordsBoolean FormulaComplete ProblemCheckable ProofProbabilistically Checkable ProofInteractive Proof SystemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
