Before revision:  First, since sub-trees in each decoding step are generated in parallel, the theoretical runtime is logarithmic rather than linear.
After revision:  From an efficiency perspective, bottom-up parsing allows to decode all sub-trees in each decoding step are generated in parallel, the theoretical runtime is logarithmic rather than linear.