It is not immediately apparent whether, in order to find a binarization of minimal parsing complexity, it is sufficient to consider only binarizations of minimal fan-out.
the fan-out of a production, ϕ(p) is the fan-out of its lefthand side, ϕ(A).