Timeline for Solving polynomial equations when you know in which number field the solutions live
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2009 at 14:59 | comment | added | Michael Hoffman | Generally Groebner basis algorithms are doubly exponential, never let them NEAR anything of that magnitude | |
| Oct 25, 2009 at 14:58 | comment | added | Charles Siegel | Ahh, if they're THAT overdetermined, I can't really offer much help to you. I don't really have anything that can handle those numbers. | |
| Oct 25, 2009 at 6:46 | comment | added | Kim Morrison | No no, these are massively overdetermined. In typical examples, we're looking at >10^5 quadratics in 20 variables. Our experience so far with Groebner bases has been unhappy -- you can't just hand off the entire list of equations to a Groebner basis implementation and expect it to cope with modern RAM constraints. If this sounds wrong, please tell us! | |
| Oct 25, 2009 at 0:16 | history | answered | Charles Siegel | CC BY-SA 2.5 |