  We consider the following practical question: given a finite algebra A in a
finite language, can we efficiently decide whether the variety generated by A
has a difference term? We answer this question (positively) in the idempotent
case and then describe algorithms for constructing difference term operations.
