Timeline for Why polynomial time is called "efficient"?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 2, 2012 at 15:54 | history | tweeted | twitter.com/#!/StackCompSci/status/186844009015148546 | ||
| Mar 11, 2012 at 23:46 | comment | added | Suresh | It's not that old a term. But I've started using it :) | |
| Mar 11, 2012 at 20:21 | comment | added | Juan Bermejo Vega | I'm just curious, does anyone know whether the term "galactic algorithm" is ever used in practice? | |
| Mar 11, 2012 at 19:22 | vote | accept | Ran G. | ||
| Mar 11, 2012 at 11:36 | comment | added | Raphael | A second, pragmatic reason for choosing P is that it is closed under addition, multiplication and exponentiation with constants. This is convenient when composing algorithms/machines; if the building blocks are efficient, so is the result. | |
| Mar 11, 2012 at 6:53 | history | answered | Suresh | CC BY-SA 3.0 |