Timeline for Must an algorithm terminate to be in NPTIME?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 28 at 8:30 | answer | added | Emil Jeřábek | timeline score: 1 | |
| Nov 27 at 20:52 | comment | added | Michael | @Nathaniel haha ok thanks Nathan | |
| Nov 27 at 20:16 | answer | added | spaceisdarkgreen | timeline score: 2 | |
| Nov 27 at 17:46 | comment | added | Nathaniel | @Michael That's why I posted a comment and not an answer. | |
| Nov 27 at 17:32 | comment | added | Michael | @spaceisdarkgreen Are you sure that this is correct for non-deterministic time bounds? | |
| Nov 27 at 17:17 | comment | added | Michael | @Nathaniel thank you for you answer but that is not what I asked | |
| Nov 27 at 17:15 | comment | added | Nathaniel | "random number" is not a really appropriate way to describe a non-deterministic choice. | |
| Nov 27 at 17:12 | comment | added | spaceisdarkgreen | The grader is correct. All computation paths need to terminate in polynomial time. | |
| S Nov 27 at 16:15 | review | First questions | |||
| Nov 28 at 6:57 | |||||
| S Nov 27 at 16:15 | history | asked | Michael | CC BY-SA 4.0 |