Talk:Promise problem
Add topicLatest comment: 5 years ago by Comiscuous in topic "Now the promise is NP-hard to evaluate, yet the promise problem is easy to solve since checking for cycles of size 4 can be done in polynomial time."
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Updating class from Stub to C. (Original rating was in 2009.) Ott2 (talk) 22:20, 20 May 2013 (UTC)
"Now the promise is NP-hard to evaluate, yet the promise problem is easy to solve since checking for cycles of size 4 can be done in polynomial time."
[edit]This sentence doesn't make much sense on it's face and needs to be elaborated on. Comiscuous (talk) 00:21, 1 July 2021 (UTC)