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: "nondeterministic quantum query and quantum communication complexities"
  Abstract: We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x)=1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a Boolean function is equal to its ``nondeterministic polynomial'' degree. We also prove a quantum-vs-classical gap of 1 vs n for nondeterministic query complexity for a total function. In the setting of communication complexity, we show that the nondeterministic quantum complexity of a two-party function is equal to the logarithm of the rank of a nondeterministic version of the communication matrix. This implies that the quantum communication complexities of the equality and disjointness functions are n+1 if we do not allow any error probability. We also exhibit a total function in which the nondeterministic quantum communication complexity is exponentially smaller than its classical counterpart.

Connected through hyperedge HE-1 (induced by source paper "post selected classical query complexity"):
  with members:
    - "the intersection of two halfspaces has high threshold degree"
    - "rectangle size bounds and threshold covers in communication complexity"

Connected through hyperedge HE-2 (induced by source paper "the border support rank of two by two matrix multiplication is seven"):
  with members:
    - "the complexity of computing the minimum rank of a sign pattern matrix"
    - "powers of tensors and fast matrix multiplication"
    - "equations for lower bounds on border rank"
    - "computing multiplicities of lie group representations"

Connected through hyperedge HE-3 (induced by source paper "communication complexity for algorithm designers"):
  with members:
    - "analysis of boolean functions"
    - "boolean function monotonicity testing requires almost n 1 2 non adaptive queries"
    - "new algorithms and lower bounds for monotonicity testing"
    - "the matching polytope has exponential extension complexity"
    - "tight bounds for the price of anarchy of simultaneous first price auctions"
    - "a o n monotonicity tester for boolean functions over the hypercube"
    - "composable and efficient mechanisms"
    - "simultaneous auctions are almost efficient"

Connected through hyperedge HE-4 (induced by source paper "tensor rank and strong quantum nondeterminism in multiparty communication"):
  with members:
    - "tensor rank some lower and upper bounds"
    - "a separation of np and conp in multiparty communication complexity"
    - "disjointness is hard in the multi party number on the forehead model"
    - "communication complexity lower bounds by polynomials"

Connected through hyperedge HE-5 (induced by source paper "exponential quantum classical gaps in multiparty nondeterministic communication complexity"):
  with members:
    - "tensor rank and strong quantum nondeterminism in multiparty communication"
    - "on arthur merlin games in communication complexity"

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)