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: "qcsp on partially reflexive forests"
  Abstract: We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive forests. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating condition is related firstly to connectivity, and thereafter to accessibility from all vertices of H to connected reflexive subgraphs. In the case of partially reflexive paths, we give a refinement of our dichotomy: QCSP(H) is either in NL or is Pspace-complete.

Connected through hyperedge HE-1 (induced by source paper "from complexity to algebra and back digraph classes collapsibility and the pgp"):
  with members:
    - "quantified constraints and containment problems"
    - "on the complexity of the model checking problem"
    - "meditations on quantified constraint satisfaction"
    - "containment equivalence and coreness from csp to qcsp and beyond"
    - "the complexity of positive first order logic without equality"
    - "the complexity of quantified constraint satisfaction collapsibility sink algebras and the three element case"

Connected through hyperedge HE-2 (induced by source paper "qcsp on partially reflexive cycles the wavy line of tractability"):
  with members:
    - "quantified constraints and containment problems"
    - "meditations on quantified constraint satisfaction"
    - "containment equivalence and coreness from csp to qcsp and beyond"
    - "the complexity of quantified constraint satisfaction collapsibility sink algebras and the three element case"

Connected through hyperedge HE-3 (induced by source paper "containment equivalence and coreness from csp to qcsp and beyond"):
  with members:
    - "quantified constraints and containment problems"
    - "meditations on quantified constraint satisfaction"

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)