Answers are grounded in this paper and cite their sources.
The problem of recognizing when a complicated mathematical expression equals zero has great importance in symbolic mathematics. This paper gives two algorithms which can be applied to many such problems, and discusses a concrete example.
No takes yet. Share an insight, caveat, or question.
S. C. Johnson (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: