How can we find the list of open problems on $NP$-comlpete?
closed as not a real question by Kaveh Feb 6 '11 at 23:46
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. If this question can be reworded to fit the rules in the help center, please edit the question.
you can also find some other problems in http://garden.irmacs.sfu.ca/?q=category/theoretical_computer_science
you can find some open Np-complete problem at the end of "computer and intractability" (Garey & Johnson)