Timeline for Counting roots: multidimensional Sturm's theorem
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2010 at 13:11 | comment | added | Boris Bukh | I went to the library: on page 996 Roy asks a question of counting the number of roots of a fewnomial by an algorithm with complexity bounded by the number of mononomials. | |
| Oct 28, 2010 at 19:30 | vote | accept | Boris Bukh | ||
| Oct 28, 2010 at 18:20 | history | edited | Thierry Zell | CC BY-SA 2.5 |
Corrected a switch between N and n in the Khovanskii bound
|
| Oct 28, 2010 at 16:30 | comment | added | Thierry Zell | I don't have the book, but I'm almost certain that it's in her article in the volume Mathematics unlimited, 2001 and Beyond amazon.com/Mathematics-Unlimited-Bj%C3%B6rn-Engquist/dp/… | |
| Oct 28, 2010 at 16:00 | comment | added | Boris Bukh | Your answer is very helpful, as it indicates what the current state of knowledge is. If you can provide a reference where Roy states this as an open problem, I will consider my question fully answered. | |
| Oct 28, 2010 at 15:51 | history | edited | Thierry Zell | CC BY-SA 2.5 |
Added the paragraphs about algorithm.
|
| Oct 28, 2010 at 15:30 | history | answered | Thierry Zell | CC BY-SA 2.5 |