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 "qcsp on partially reflexive cycles the wavy line of tractability"):
  Abstract: We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive cycles. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating conditions are somewhat esoteric hence the epithet "wavy line of tractability".

Includes members:
  Member "quantified constraints and containment problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "qcsp monsters and the demise of the chen conjecture")
  Member "meditations on quantified constraint satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "qcsp monsters and the demise of the chen conjecture")
  Member "containment equivalence and coreness from csp to qcsp and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "from complexity to algebra and back digraph classes collapsibility and the pgp")
  Member "qcsp on partially reflexive forests":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "from complexity to algebra and back digraph classes collapsibility and the pgp")
  Member "the complexity of quantified constraint satisfaction collapsibility sink algebras and the three element case":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "qcsp monsters and the demise of the chen conjecture")

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)