human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"):
  Abstract: For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k>1, there is a polynomial-time algorithm that, for a 1-connected topological space X given as a finite simplicial complex, or more generally, as a simplicial set with polynomial-time homology, computes the k-th homotopy group \pi_k(X), as well as the first k stages of a Postnikov system of X. Combined with results of an earlier paper, this yields a polynomial-time computation of [X,Y], i.e., all homotopy classes of continuous mappings X -> Y, under the assumption that Y is (k-1)-connected and dim X   Y, and the question is the extendability of f to all of X. #R##N#The algorithms are based on the notion of a simplicial set with polynomial-time homology, which is an enhancement of the notion of a simplicial set with effective homology developed earlier by Sergeraert and his co-workers. Our polynomial-time algorithms are obtained by showing that simplicial sets with polynomial-time homology are closed under various operations, most notably, Cartesian products, twisted Cartesian products, and classifying space. One of the key components is also polynomial-time homology for the Eilenberg--MacLane space K(Z,1), provided in another recent paper by Krcal, Matousek, and Sergeraert.

Includes members:
  Member "extendability of continuous maps is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "solving equations and optimization problems with uncertainty")
  Member "computing higher homotopy groups is w 1 hard":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing simplicial representatives of homotopy group elements")
  Member "polynomial time homology for simplicial eilenberg maclane spaces":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "solving equations and optimization problems with uncertainty")
  Member "computing all maps into a sphere":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing simplicial representatives of homotopy group elements")
  Member "complexity and algorithms for euler characteristic of simplicial complexes":
    also connected through other hyperedges:
      (none)
  Member "computing spectral sequences":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing simplicial representatives of homotopy group elements")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CG(Computational Geometry)