ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (56 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0166-8641(02)00340-1    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2002 Elsevier Science B.V. All rights reserved.

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

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Antonio Garvín and Luis LechugaCorresponding Author Contact Information, E-mail The Corresponding Author

Escuela Universitaria Politécnica, Universidad de Málaga, Departamento de Matemática Aplicada, Campus de El Ejido, 29071, Málaga, Spain


Received 18 September 2002; 
revised 15 October 2002. 
Available online 17 April 2003.

Abstract

Let S a 1-connected space such that Image and Image 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

Corresponding Author Contact InformationCorresponding author.


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2009 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.