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 "the computational complexity of fire emblem series and similar tactical role playing games"):
  Abstract: Fire Emblem (FE) is a popular turn-based tactical role-playing game (TRPG) series on the Nintendo gaming consoles. This paper studies the computational complexity of a simplified version of FE (only floor tiles and wall tiles, the HP and other attributes of characters are constants at most 8, the movement distance per character each turn is fixed to 6 tiles), and proves that: 1. Simplified FE is PSPACE-complete (Thus actual FE is at least as hard). 2. Poly-round FE is NP-complete, even when the map is cycle-free, without healing units, and the weapon durability is a small constant. Poly-round FE is to decide whether the player can win the game in a certain number of rounds that is polynomial to the map size. A map is called cycle-free if its corresponding planar graph is cycle-free. These hardness results also hold for other similar TRPG series, such as Final Fantasy Tactics, Tactics Ogre and Disgaea.

Includes members:
  Member "computational complexity of games and puzzles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ludii and xcsp playing and solving logic puzzles")
  Member "trainyard is np hard":
    also connected through other hyperedges:
      (none)
  Member "on planar variants of the monotone satisfiability problem with bounded variable appearances":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reconstruction of weakly simple polygons from their edges")
  Member "the computational complexity of portal and other 3d video games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the computational complexity of angry birds")
  Member "candy crush is np hard":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the computational complexity of angry birds")
  Member "classic nintendo games are computationally hard":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the computational complexity of angry birds")
  Member "lemmings is pspace complete":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the computational complexity of angry birds")
  Member "the complexity of the puzzles of final fantasy xiii 2":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the computational complexity of portal and other 3d video games")

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.CC(Computational Complexity)