Computer algebra of the Mathematica/Maple variety is not formally rigorous: it will get things wrong due to conflating function domains, choices of branch cuts for 'multi-valued functions' and other assumptions that are required for correct results but not exposed or verified. The work of providing "strong and fast algorithms" that are comprehensively described ought to be done as part of building proof systems for the underlying mathematics that will ensure correctness.