Timeline for Solving recurrence relation when cost of all combining steps is constrained
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2016 at 12:34 | history | tweeted | twitter.com/StackCompSci/status/728563532434911232 | ||
| May 6, 2016 at 8:29 | comment | added | Yuval Filmus | @Raphel Not a duplicate. Akra–Bazzi works best when the function $f(n)$ is explicit. | |
| May 6, 2016 at 8:27 | answer | added | Yuval Filmus | timeline score: 1 | |
| May 6, 2016 at 6:13 | comment | added | Raphael | Our reference question has an answer about Akra-Bazzi, which solves this recurrence up to $\Theta$. Duplicate? | |
| May 6, 2016 at 6:11 | history | edited | Raphael |
edited tags
|
|
| May 6, 2016 at 1:33 | history | edited | P. Krull | CC BY-SA 3.0 |
added 271 characters in body
|
| May 6, 2016 at 1:15 | history | edited | P. Krull | CC BY-SA 3.0 |
added 104 characters in body
|
| May 5, 2016 at 22:35 | history | edited | P. Krull | CC BY-SA 3.0 |
added 14 characters in body
|
| May 5, 2016 at 16:58 | review | First posts | |||
| May 5, 2016 at 18:24 | |||||
| May 5, 2016 at 16:56 | history | asked | P. Krull | CC BY-SA 3.0 |