Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, p. 238-41
In an ordered algebraic extension field of the rationals algorithms for sign determinations are studied. Two new algorithms are analyzed in detail and shown to be asymptotically and in practice faster than previous algorithms.
