A Bound for the Order of Characteristic Set Elements of an Ordinary Prime Differential Ideal and some Applications
With respect to an elimination ordering, we give an upper bound for the order of characteristic set elements of an ordinary prime differential ideal. Using some results of complexity in the algebraic case, we show that computing characteristic sets of ordinary prime differential ideals, by change of ordering, is single exponential time.
Unable to display preview. Download preview PDF.