We experimentally compare the two algorithms A and B
by Fredman and Khachiyan (1996) for the
problem Monet---given a monotone Boolean
formula in DNF and another in CNF, decide
whether they both are equivalent.
Currently, algorithm B is the
Monet algorithm with the best known worst-case
performance.
However, there is no experimental evaluation
of its practical performance yet,
mainly due to the following two reasons.
Firstly, implementation of algorithm B is usually considered
to be more involved than for algorithm A.
Secondly and probably more importantly, there is the
assumption that the
operations performed by algorithm B to ensure
recursion on smaller sub-problems do only pay off
theoretically.
In this paper, we contrast this assumption
by experimentally
showing algorithm B to be competitive and even
superior to algorithm A on many instances.