Reply to post:

That virtually impossible classic compsci P vs NP problem is virtually impossible, say boffins

Charles 9

IOW, it can't be solved deterministically, which is one way to class an NP problem (NP stands for Nondeterministic Polynomial).

POST COMMENT House rules

Not a member of The Register? Create a new account here.

  • Enter your comment

  • Add an icon

Anonymous cowards cannot choose their icon