What is the computational complexity of Latent Dirichlet Allocation in terms of the number of documents (D), topics (T), average length of documents (L), and words (W)?
It depends on your memory. LDA adapts a probabilistic approach that calculates the probability of the topic. Your memory performs the computations. If you have infinite memory, the computational complexity is zero.