The computation of the Betti numbers of an elliptic space is a NP-hard problem

Let S a 1-connected space such that π∗(S)⊗Q and H∗(S;Q) are both finite-dimensional. Then, using the Sullivan model as a codification for S, we prove that the computation of the Betti numbers of S is a NP-hard problem.