Copyright © 2002 Elsevier Science B.V. All rights reserved.
The computation of the Betti numbers of an elliptic space is a NP-hard problem
Received 18 September 2002;
revised 15 October 2002.
Available online 17 April 2003.
Abstract
Let S a 1-connected space such that
and
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.
Author Keywords: Rational homotopy; Complexity; NP-hard problem






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)









