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 "a separation of np and conp in multiparty communication complexity"):
  Abstract: We prove that NP differs from coNP and coNP is not a subset of MA in the number-on-forehead model of multiparty communication complexity for up to k = (1-\epsilon)log(n) players, where \epsilon>0 is any constant. Specifically, we construct a function F with co-nondeterministic complexity O(log(n)) and Merlin-Arthur complexity n^{\Omega(1)}. The problem was open for k > 2.

Includes members:
  Member "multiparty communication complexity of disjointness":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a nearly optimal lower bound on the approximate degree of ac 0")
  Member "separating nof communication complexity classes rp and np":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a nearly optimal lower bound on the approximate degree of ac 0")
  Member "communication lower bounds using dual polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the degree of boolean functions as polynomials over mathbb z _m")
  Member "disjointness is hard in the multi party number on the forehead model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hardness amplification and the approximate degree of constant depth circuits")
  Member "rectangle size bounds and threshold covers in communication complexity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the hardness of approximate and exact bichromatic maximum inner product")

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)