A naive approach of computing the bidirectional representation of all n elements result in O(n 2 ) computation.
it is trivial to compute the BiRNN encoding of all sequence items in linear time by pre-computing RNN F (x 1:n ) and RNN R (x n:1 ), keeping the intermediate representations, and concatenating the required elements as needed.