  We give a specific method to solve with quadratic complexity the linear
systems arising in known algorithms to deal with the sign determination
problem. In particular, this enable us to improve the complexity bound for sign
determination in the univariate case.
