Timeline for For which algorithms is there a large gap between the theoretical analysis and reality?
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 21, 2010 at 0:14 | comment | added | jbapple | Seth Pettie proved that n deque operations take no more than O(n alpha*(n)) time, where "alpha*" is the iterated inverse Ackermann function, which is a pretty small gap. | |
| Aug 19, 2010 at 12:18 | history | answered | Radu GRIGore | CC BY-SA 2.5 |