While the computation of Grobner bases is known to be an exsapace complete problem, the generic behavior of the algorithms for their bases and analyze precisely the best algorithm currently known.

Keywords:

Analysis of algorithms; Grobner bases; generic complexity; coalescence of saddle-points.

Lecture #10597

Need help? Visit our help pages at http://www.msri.org/communications/vmath/hints

The video is in post production and will be posted shortly.

See more of our Streaming Videos on our main VMath - Streaming Video page.