|
|
|
|
|
|
by wenc
1153 days ago
|
|
|
I tried using Groebner bases in grad school to solve implicit polynomial equations (part of an optimization problem) but found quickly that it didn’t scale. I ran into trouble with a system of about 300 polynomials and this was with Maple which implemented state of the art algorithms at the time. The computational complexity of Groebner is doubly exponential in the number of variables. |
|
|