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 complexity of computing minimal unidirectional covering sets"):
  Abstract: A common thread in the social sciences is to identify sets of alternatives that satisfy certain notions of stability according to some binary dominance relation. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Brandt and Fischer (in Math. Soc. Sci. 56(2):254---268, 2008) proved that it is NP-hard to decide whether an alternative is contained in some inclusion-minimal unidirectional (i.e., either upward or downward) covering set. For both problems, we raise this lower bound to the $\varTheta_{2}^{p}$ level of the polynomial hierarchy and provide a $\varSigma_{2}^{p}$ upper bound. Relatedly, we show that a variety of other natural problems regarding minimal or minimum-size unidirectional covering sets are hard or complete for either of NP, coNP, and $\varTheta_{2}^{p}$ . An important consequence of our results is that neither minimal upward nor minimal downward covering sets (even when guaranteed to exist) can be computed in polynomial time unless P=NP. This sharply contrasts with Brandt and Fischer's result that minimal bidirectional covering sets are polynomial-time computable.

Includes members:
  Member "hybrid elections broaden complexity theoretic resistance to control":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a parameterized perspective on protecting elections")
  Member "a richer understanding of the complexity of election systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computational social choice and computational complexity bffs")
  Member "recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to np":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complexity of the exact domatic number problem and of the exact conveyor flow shop problem")
  Member "exact complexity of the winner problem for young elections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "raising np lower bounds to parallel np lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computational social choice and computational complexity bffs")
  Member "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "incomplete preferences in single peaked electorates")

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)