View Single Post
burritoloco
#6
Jun15-11, 08:21 PM
P: 85
Hmm, resultants and Thm 4.2 seem to be general methods on any two polynomials f(x), g(x) to obtain F(x). What if there are special classes of polynomials for which this computation could be done totally differently and much faster than the O(n^3 log^2(n)) in their paper? But what is this all good for anyways lol.