Timeline for What is an Efficient Algorithm?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 21, 2016 at 8:10 | history | edited | adrianN | CC BY-SA 3.0 |
added reference
|
| Mar 13, 2013 at 14:39 | vote | accept | Robert S. Barnes | ||
| Mar 13, 2013 at 8:25 | comment | added | Raphael | @RobertS.Barnes: Different words, same problem. | |
| Mar 13, 2013 at 8:04 | comment | added | Robert S. Barnes | Maybe "efficient" isn't really the right terminology in the first place? I was just reviewing one of my calculus books, and the author calls polynomial runtimes "tractable" and exponential runtimes "intractable". | |
| Mar 12, 2013 at 20:36 | comment | added | SamM | This doesn't really necessitate its own answer, but BPP, which is the class of functions with polynomial runtime (as described in the answer) with randomness as well, is often considered efficient. In other words, the above is right, but computers are generally allowed to access randomness to do calculations. One of the most important practical uses of randomness is hashing. | |
| Mar 12, 2013 at 17:39 | history | edited | adrianN | CC BY-SA 3.0 |
added 11 characters in body
|
| Mar 12, 2013 at 14:13 | comment | added | Raphael | In short: efficient is what solves your problem in a timeframe that suits you. | |
| Mar 12, 2013 at 11:21 | history | edited | adrianN | CC BY-SA 3.0 |
added 201 characters in body
|
| Mar 12, 2013 at 11:14 | history | answered | adrianN | CC BY-SA 3.0 |