MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

We are looking for the most efficient (most recent, or best) techniques to check if two algebraic expressions (elementary, Calculus-type functions) are equivalent (or if an expression is equivalent to zero, which is the so-called "zero-equivalence" problem). So far we came across two papers that seem to be relatively easy to implement:

"Determining the equivalence of algebraic expressions by hash coding" by William Martin, 1971


"Determining equivalence of expressions in random polynomial time" by Gaston Gonnet, 1984

but both are not easy to read and it seems like there are many details missing.

Here is the question: is there any more recent research in this direction? Maybe, a book or a paper which is more accessible?

Best, Denis

share|cite|improve this question
Yes, this is a repost, I'm sorry. We still need help with this question. – Denis Serbin Sep 17 '13 at 4:10

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.