human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "candy crush is np hard"
  Abstract: We prove that playing Candy Crush to achieve a given score in a fixed number of swaps is NP-hard.

Connected through hyperedge HE-1 (induced by source paper "the computational complexity of angry birds"):
  with members:
    - "the computational complexity of portal and other 3d video games"
    - "pspace completeness of bloxorz and of games with 2 buttons"
    - "braid is undecidable"
    - "a bayesian ensemble regression framework on the angry birds game"
    - "bejeweled candy crush and other match three games are np hard"
    - "towards a theory of mind inspired generic decision making framework"
    - "classic nintendo games are computationally hard"
    - "lemmings is pspace complete"

Connected through hyperedge HE-2 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games"):
  with members:
    - "computational complexity of games and puzzles"
    - "trainyard is np hard"
    - "on planar variants of the monotone satisfiability problem with bounded variable appearances"
    - "the computational complexity of portal and other 3d video games"
    - "classic nintendo games are computationally hard"
    - "lemmings is pspace complete"
    - "the complexity of the puzzles of final fantasy xiii 2"
    - "gaming is a hard job but someone has to do it"

Connected through hyperedge HE-3 (induced by source paper "np completeness of the game kingdomino"):
  with members:
    - "monte carlo methods for the game kingdomino"
    - "hanabi is np complete even for cheaters who look at their cards"
    - "an aperiodic set of 11 wang tiles"
    - "bejeweled candy crush and other match three games are np hard"
    - "the computational complexity of the game of set and its theoretical applications"
    - "domino tatami covering is np complete"
    - "classic nintendo games are computationally hard"

Connected through hyperedge HE-4 (induced by source paper "hanabi is np hard even for cheaters who look at their cards"):
  with members:
    - "bejeweled candy crush and other match three games are np hard"
    - "the computational complexity of the game of set and its theoretical applications"
    - "tetris is hard even to approximate"
    - "playing games with algorithms algorithmic combinatorial game theory"

Connected through hyperedge HE-5 (induced by source paper "the computational complexity of portal and other 3d video games"):
  with members:
    - "lemmings is pspace complete"
    - "the complexity of the puzzles of final fantasy xiii 2"
    - "playing games with algorithms algorithmic combinatorial game theory"

Connected through hyperedge HE-6 (induced by source paper "hanabi is np complete even for cheaters who look at their cards"):
  with members:
    - "playing games with algorithms algorithmic combinatorial game theory"

Connected through hyperedge HE-7 (induced by source paper "on a generalization of eight blocks to madness"):
  with members:
    - "classic nintendo games are computationally hard"
    - "there is no 16 clue sudoku solving the sudoku minimum number of clues problem"
    - "tetris is hard even to approximate"

Connected through hyperedge HE-8 (induced by source paper "bejeweled candy crush and other match three games are np hard"):
  with members:
    - "gaming is a hard job but someone has to do it"
    - "tetris is hard even to approximate"

Question: Please tell me which class the center node 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)