We prove an exponential lower bound on the size of any
fixed-degree algebraic decision tree for solving MAX, the
problem of finding the maximum of n real numbers. This
complements the n-1 lower bound of Rabin \cite{R72} on
the depth of ... more >>>