<p>you can also find some other problems in <a href="http://garden.irmacs.sfu.ca/?q=category/theoretical_computer_science" rel="nofollow">http://garden.irmacs.sfu.ca/?q=category/theoretical_computer_science</a></p>

CC BY-SA 2.5
2011-01-01T15:57:38.890Z
Edit your previous answer instead adding new answers.
Saeed
CC BY-SA 2.5
2011-01-02T13:10:17.027Z
@Saeed: Although I upvoted your comment, after thinking about it again, I am not sure if I agree.  There are cases where posting two answers separately is acceptable.  Although the user 3008 could have edited the older answer, I do not know why he/she _should_ have done so or anyone could order him/her to do so.
Tsuyoshi Ito
CC BY-SA 2.5
2011-01-02T14:49:46.303Z
@Tsuyoshi Ito 伊藤剛志, yes may be if I said it's better to ... was better (but is not normal in QA sites), but if anyone wants to show his/her force to create new answer,I think he/she will downvote this answer. In this case I think user 3008 can edit answer and add too many item, I think user 3008 didn't see edit button.
Saeed
CC BY-SA 2.5
2011-01-01T15:35:14.760Z
2011-01-01T15:35:14.760Z
user3008
<p>you can find some open Np-complete problem at the end of "computer and intractability" (Garey &amp; Johnson)</p>

CC BY-SA 2.5
2011-01-03T02:55:45.440Z
-1: That is an old list.
Aryabhata
CC BY-SA 2.5
2011-01-01T15:29:20.597Z
2011-01-01T15:29:20.597Z
user3008
<p>How can we find the list of open problems on $NP$-comlpete?</p>

CC BY-SA 2.5
2011-01-01T15:21:30.627Z
Do you mean a list of NP problems which are not known to be in P nor to be NP-complete? If so, this topic is an exact duplicate of [Problems Between P and NPC](http://cstheory.stackexchange.com/q/79/873).
Sadeq Dousti
CC BY-SA 2.5
2011-01-02T06:05:37.367Z
It's difficult to tell what is being asked here. This question is ambiguous and vague, and without clarification cannot be reasonably answered in its current form. I am voting to close as "not a real question".
Kaveh
CC BY-SA 2.5
2011-01-02T09:20:09.450Z
You can try the NP-Completeness columns: http://www2.research.att.com/~dsj/columns/. But I agree, this question is just too vague. Perhaps it can be rephrased as a reference request to a survey or something.
Aryabhata
CC BY-SA 2.5
2011-02-06T23:48:53.340Z
misagh, I closed this question because it is not clear what you are asking for and you have not replied to the comments after a month. We can reopen the question if you clarify it, just clarify it and then flag it for moderator attention. Thanks.
Kaveh
<cc.complexity-theory><reference-request><np-hardness>
open problems on $NP$-complete?
misagh
# open problems on $NP$-complete?

(Asked by: username_0 on 2011-01-01)

How can we find the list of open problems on $NP$-comlpete?

**Tags:** cc.complexity-theory, reference-request, np-hardness

> **Comments:**
> **username_1**: Do you mean a list of NP problems which are not known to be in P nor to be NP-complete? If so, this topic is an exact duplicate of [Problems Between P and NPC](http://cstheory.stackexchange.com/q/79/873).  
> **username_2**: It's difficult to tell what is being asked here. This question is ambiguous and vague, and without clarification cannot be reasonably answered in its current form. I am voting to close as "not a real question".  
> **username_3**: You can try the NP-Completeness columns: http://www2.research.att.com/~dsj/columns/. But I agree, this question is just too vague. Perhaps it can be rephrased as a reference request to a survey or something.  
> **username_2**: username_0, I closed this question because it is not clear what you are asking for and you have not replied to the comments after a month. We can reopen the question if you clarify it, just clarify it and then flag it for moderator attention. Thanks.  

---

## 2 answers

### Answer by username_4 on 2011-01-01. Score: 0 | Accepted answer

you can also find some other problems in <http://garden.irmacs.sfu.ca/?q=category/theoretical_computer_science>

> **Comments:**
> **username_5**: Edit your previous answer instead adding new answers.  
> **username_6**: @username_5: Although I upvoted your comment, after thinking about it again, I am not sure if I agree.  There are cases where posting two answers separately is acceptable.  Although the user 3008 could have edited the older answer, I do not know why he/she _should_ have done so or anyone could order him/her to do so.  
> **username_5**: @username_6 伊藤剛志, yes may be if I said it's better to ... was better (but is not normal in QA sites), but if anyone wants to show his/her force to create new answer,I think he/she will downvote this answer. In this case I think user 3008 can edit answer and add too many item, I think user 3008 didn't see edit button.  

---

### Answer by username_4 on 2011-01-01. Score: -2

you can find some open Np-complete problem at the end of "computer and intractability" (Garey & Johnson)

> **Comments:**
> **username_3**: -1: That is an old list.  

---

