• Title of article

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

  • Author/Authors

    Garv?́n، نويسنده , , Antonio and Lechuga، نويسنده , , Luis، نويسنده ,

  • Issue Information
    دوماهنامه با شماره پیاپی سال 2003
  • Pages
    4
  • From page
    235
  • To page
    238
  • Abstract
    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.
  • Keywords
    rational homotopy , Complexity , NP-hard problem
  • Journal title
    Topology and its Applications
  • Serial Year
    2003
  • Journal title
    Topology and its Applications
  • Record number

    1580369