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 "np completeness of the game kingdomino"):
  Abstract: Kingdomino is a board game designed by Bruno Cathala and edited by Blue Orange since 2016. The goal is to place $2 \times 1$ dominoes on a grid layout, and get a better score than other players. Each $1 \times 1$ domino cell has a color that must match at least one adjacent cell, and an integer number of crowns (possibly none) used to compute the score. We prove that even with full knowledge of the future of the game, in order to maximize their score at Kingdomino, players are faced with an NP-complete optimization problem.

Includes members:
  Member "monte carlo methods for the game kingdomino":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "state representation and polyomino placement for the game patchwork")
  Member "hanabi is np complete even for cheaters who look at their cards":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reachability games in dynamic epistemic logic")
  Member "an aperiodic set of 11 wang tiles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "slopes of 3 dimensional subshifts of finite type")
  Member "bejeweled candy crush and other match three games are np hard":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the computational complexity of angry birds")
  Member "candy crush is np hard":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the computational complexity of angry birds")
  Member "the computational complexity of the game of set and its theoretical applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hanabi is np hard even for cheaters who look at their cards")
  Member "domino tatami covering is np complete":
    also connected through other hyperedges:
      (none)
  Member "classic nintendo games are computationally hard":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the computational complexity of angry birds")

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)