Timeline for Must an algorithm terminate to be in NPTIME?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 27 at 21:06 | comment | added | Michael | Thanks for your time! You're a legend | |
| Nov 27 at 20:55 | comment | added | spaceisdarkgreen | @Michael Yep, that's the idea. | |
| Nov 27 at 20:49 | history | edited | spaceisdarkgreen | CC BY-SA 4.0 |
added 149 characters in body
|
| Nov 27 at 20:49 | comment | added | Michael | Thanks a lot, this makes a lot more sense now. As I now understand it the idea of NP is that we can 'guess' a solution and then verify that it is right or wrong in polynomial time. | |
| Nov 27 at 20:16 | history | answered | spaceisdarkgreen | CC BY-SA 4.0 |