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 angry birds"):
  Abstract: Abstract   The physics-based simulation game Angry Birds has been heavily researched by the AI community over the past five years, and has been the subject of a popular AI competition that is currently held annually as part of a leading AI conference. Developing intelligent agents that can play this game effectively has been an incredibly complex and challenging problem for traditional AI techniques to solve, even though the game is simple enough that any human player could learn and master it within a short time. In this paper we analyse how hard the problem really is, presenting several proofs for the computational complexity of Angry Birds. By using a combination of several gadgets within this game's environment, we are able to demonstrate that the decision problem of solving general levels for different versions of Angry Birds is either NP-hard, PSPACE-hard, PSPACE-complete or EXPTIME-hard. Proof of NP-hardness is by reduction from 3-SAT, whilst proof of PSPACE-hardness is by reduction from True Quantified Boolean Formula (TQBF). Proof of EXPTIME-hardness is by reduction from G2, a known EXPTIME-complete problem similar to that used for many previous games such as Chess, Go and Checkers. To the best of our knowledge, this is the first time that a single-player game has been proven EXPTIME-hard. This is achieved by using stochastic game engine dynamics to effectively model the real world, or in our case the physics simulator, as the opponent against which we are playing. These proofs can also be extended to other physics-based games with similar mechanics.

Includes members:
  Member "the computational complexity of portal and other 3d video games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games")
  Member "pspace completeness of bloxorz and of games with 2 buttons":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a general theory of motion planning complexity characterizing which gadgets make games hard")
  Member "braid is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "recursed is not recursive a jarring result")
  Member "a bayesian ensemble regression framework on the angry birds game":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "agent based adaptive level generation for dynamic difficulty adjustment in angry birds")
  Member "bejeweled candy crush and other match three games are np hard":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "np completeness of the game kingdomino")
  Member "towards a theory of mind inspired generic decision making framework":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "agent based adaptive level generation for dynamic difficulty adjustment in angry birds")
  Member "candy crush is np hard":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games")
  Member "classic nintendo games are computationally hard":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing 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)