Timeline for What are the definitions for "hard problem" and "easy problem"?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 20, 2023 at 16:53 | comment | added | greybeard | There's difficult, and there's difficult, Asian style: anywhere between wouldn't know how to beyond machines&mortals. Is there any way to retrieving the message from [a fixed size] hash? (I wouldn't call something with length not dwarfed by message length for long messages a *hash.) | |
| Dec 19, 2023 at 15:20 | answer | added | gnasher729 | timeline score: 0 | |
| Dec 19, 2023 at 14:56 | answer | added | Chuck | timeline score: 0 | |
| Sep 27, 2015 at 19:15 | history | tweeted | twitter.com/#!/StackCompSci/status/648214338931699713 | ||
| Sep 26, 2015 at 19:50 | comment | added | peterh | In most cases "hard" means that its resource-need grows exponentially with the input (i.e. no essentially faster solutions as trial by one exist). But it is a highly inexact answer. | |
| Sep 26, 2015 at 18:33 | vote | accept | Likk | ||
| Sep 26, 2015 at 17:06 | answer | added | David Richerby | timeline score: 9 | |
| Sep 26, 2015 at 16:49 | comment | added | Juho | Likely this depends on the context. Usually, one can say a problem is easy if it can be solved in polynomial time. Similarly, a problem is said to be hard if there is no known polynomial time algorithm for it, e.g. the problem is say NP-complete. | |
| Sep 26, 2015 at 16:31 | review | First posts | |||
| Sep 26, 2015 at 17:06 | |||||
| Sep 26, 2015 at 16:31 | history | asked | Likk | CC BY-SA 3.0 |