Timeline for What is meant by "solvable by non deterministic algorithm in polynomial time"
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 18, 2016 at 8:01 | comment | added | Evil | I never imagined that someone could mix randomized algorithm, P=NP, cryptography, conspiracy, Alan Turing acredited for M. Rejewski work, ending wrong on so many levels. | |
| Feb 17, 2016 at 18:58 | comment | added | David Richerby | No, no, no. Nondeterminism is not randomness. | |
| Feb 17, 2016 at 7:16 | comment | added | Raphael | "A non-deterministic algorithm is one where the input includes a random choice." -- Wrong. | |
| Feb 17, 2016 at 4:43 | review | Late answers | |||
| Feb 17, 2016 at 14:24 | |||||
| Feb 17, 2016 at 4:26 | review | First posts | |||
| Feb 17, 2016 at 18:58 | |||||
| Feb 17, 2016 at 4:23 | history | answered | Gideon Samid | CC BY-SA 3.0 |