Timeline for Can a NP problem be reduced to another NP problem?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 26, 2019 at 18:56 | vote | accept | Abhilash Mishra | ||
| Apr 19, 2019 at 15:28 | history | edited | David Richerby | CC BY-SA 4.0 |
Formatting
|
| Apr 19, 2019 at 15:26 | answer | added | David Richerby | timeline score: 6 | |
| Apr 19, 2019 at 15:11 | comment | added | Discrete lizard♦ | There are many types of reductions other than polynomial time reductions and some of them are useful. I suggest you take a look at en.wikipedia.org/wiki/Reduction_(complexity). | |
| Apr 19, 2019 at 14:41 | history | asked | Abhilash Mishra | CC BY-SA 4.0 |