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: "generalized majority minority operations are tractable"
  Abstract: Generalized majority-minority (GMM) operations are introduced as a common#N#generalization of near unanimity operations and Mal'tsev operations on finite#N#sets. We show that every instance of the constraint satisfaction problem (CSP),#N#where all constraint relations are invariant under a (fixed) GMM operation, is#N#solvable in polynomial time. This constitutes one of the largest tractable#N#cases of the CSP.

Connected through hyperedge HE-1 (induced by source paper "the power of arc consistency for csps defined by partially ordered forbidden patterns"):
  with members:
    - "hybrid v csps and algebraic reductions"
    - "effectiveness of structural restrictions for hybrid csps"
    - "tractable hypergraph properties for constraint satisfaction and conjunctive queries"

Connected through hyperedge HE-2 (induced by source paper "the dichotomy for conservative constraint satisfaction is polynomially decidable"):
  with members:
    - "asking the metaquestions in constraint tractability"
    - "conservative constraint satisfaction re revisited"

Connected through hyperedge HE-3 (induced by source paper "logic column 17 a rendezvous of logic complexity and algebra"):
  with members:
    - "a characterisation of first order constraint satisfaction problems"
    - "on tractability and congruence distributivity"
    - "linear datalog and bounded path duality of relational structures"

Connected through hyperedge HE-4 (induced by source paper "the complexity of quantified constraint satisfaction collapsibility sink algebras and the three element case"):
  with members:
    - "on tractability and congruence distributivity"

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)