For a certain class of algebraic algorithms, we propose a new method that reduces the number of exact computational steps needed for obtaining exact results. This method is the floating-point interval method using zero rewriting and symbols. Zero rewriting, which is from stabilization techniques, rewrites an interval coefficient into the zero interval if the interval contains zero. Symbols are used to keep track of the execution path of the original algorithm with exact computations, so that the associated real coefficients can be computed by evaluating the symbols. The key point is that at each stage of zero rewriting, one checks to see if the zero rewriting is really correct; namely, an interval that has been rewritten into zero is really zero by exploiting the associated symbol. This method mostly uses floating-point computations; the exact computations are only performed at the stage of zero rewriting and in the final evaluation to get the exact coefficients. Moreover, one does not need to check the correctness of the output.