Next: Signatures of boolean expressions
Up: Heuristic equivalence testing and
Previous: Non-standard uses of signatures
There are several open problems with signatures.
Some we know that are likely to be impossible to solve, as
their solution would imply that P=NP.
Others are still open and their solution may have a truly
profound impact in practical and effective computer algebra.