Hacker News new | ask | show | jobs
by dpritchett 5891 days ago
So it was an NP-complete problem with a fixed time requirement?

Edit: That was rude. My apologies.
2 comments
kscaldef 5891 days ago
More likely it was simply logically inconsistent. That's not at all rare in requirements documents.
link
eru 5891 days ago
A P problem with a fixed time requirement is also not possible.

(But NP may be possible to solve in polynomial time. Who knows?)

link
SandB0x 5891 days ago
John knew?
link