Timeline for How to prove that existence of one-way functions implies P≠NP?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 23, 2021 at 21:48 | comment | added | Yuval Filmus | The index represents individual bits. | |
| Apr 23, 2021 at 21:45 | comment | added | kelalaka | What does the sub-index represent here? | |
| Apr 22, 2021 at 20:48 | comment | added | Yuval Filmus | It's a machine that can solve NP problems. If P=NP, then you can simulate an NP oracle with a standard Turing machine. | |
| Apr 22, 2021 at 19:54 | comment | added | porton | Is NP oracle the same as polynomial-time NP-complete algorithm? Or what is it? | |
| Apr 22, 2021 at 19:52 | vote | accept | porton | ||
| Apr 22, 2021 at 14:45 | history | answered | Yuval Filmus | CC BY-SA 4.0 |