Timeline for How can you find small denominators inside triangles?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15, 2009 at 6:04 | comment | added | Darsh Ranjan | When I originally asked this question (in the seminar mentioned in the posted question), I did ask for an efficient algorithm, but I probably didn't emphasize it enough. :-) Solving the 1D version by continued fractions, we can achieve complexity proportional to the number of terms in the continued fraction of the answer, which is at worst O(log(d)) (where d is the smallest denominator). That may be too optimistic for 2D, but could polylog(d) be achievable? | |
| Oct 5, 2009 at 0:13 | history | edited | Kim Morrison | CC BY-SA 2.5 |
edited body
|
| Oct 5, 2009 at 0:08 | vote | accept | Kim Morrison | ||
| Oct 4, 2009 at 22:13 | history | answered | Ilya Nikokoshev | CC BY-SA 2.5 |