3 ms·

So it was an NP-complete problem with a fixed time requirement? Edit: That was rude. My apologies.

• kscaldef 17y ago
  More likely it was simply logically inconsistent. That's not at all rare in requirements documents.
• eru 17y 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?)
  • SandB0x 17y ago
    John knew?