Timeline for Can a more powerful encoding of an input make an algorithm that is polynomial in the number of inputs become exponential?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 27, 2020 at 17:51 | vote | accept | kanso37 | ||
| Mar 27, 2020 at 17:50 | comment | added | kanso37 | Thanks for the detailed answer! The link is also much appreciated. I hadn't heard of ideas like "information-theoretic lower bounds" before. | |
| Mar 27, 2020 at 1:52 | history | answered | D.W.♦ | CC BY-SA 4.0 |