Jordan Mitchell Barrett
  • Member for 2 years, 10 months
  • Last seen more than a month ago
Problems that started out with hopelessly intractable algorithms that have since been made extremely efficient
4 votes

The ideal membership problem: if $f_1, \ldots, f_s$ are polynomials of degree at most $d$ with variables in $x_1, \ldots, x_n$, then are there $g_1, \ldots, g_n$ such that $f_1g_1 + \cdots + f_ng_n = ...

View answer