Timeline for A random walk with uniformly distributed steps II
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 20, 2012 at 17:38 | history | edited | Lwins | CC BY-SA 3.0 |
edited body
|
| Apr 20, 2012 at 9:18 | comment | added | user5810 | How do you wind up with a nice polynomial complexity using a fourier transform? $\hspace{1.2 in}$ I've always seen fourier transforms contribute log factors. $\;$ | |
| Apr 20, 2012 at 7:31 | comment | added | Johan Wästlund | Can you describe your method? What are the first few $P_n$ when, say, $l=1$ and $r=2$ (or the other way around)? | |
| Apr 20, 2012 at 7:18 | history | edited | Lwins | CC BY-SA 3.0 |
added 86 characters in body
|
| Apr 20, 2012 at 7:12 | history | asked | Lwins | CC BY-SA 3.0 |