Timeline for How are "Problem Complexity" and "Solution Complexity" different?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 19, 2020 at 0:18 | history | edited | Narek Bojikian | CC BY-SA 4.0 |
added 16 characters in body
|
| Feb 18, 2020 at 23:34 | vote | accept | dalgo | ||
| Feb 18, 2020 at 23:34 | comment | added | dalgo | This is very clear, thanks. "An algorithm is an upper-bound bound for the complexity of the problem it solves" wrapped it all together for me. | |
| Feb 18, 2020 at 18:26 | history | answered | Narek Bojikian | CC BY-SA 4.0 |