In recent years a number of algorithms have been designed for the "inverse" computational problems of polynomial algebra—factoring polynomials, solving systems of polynomial equations, or systems of polynomial inequalities, and related problems—with running time considerably less than that of the algorithms which were previously known. (For the computational complexity of the "direct" problems such as polynomial multiplication or determination of g.c.d.'s see [1, 16] and also [9].) It should be… CONTINUE READING