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 "variable and value elimination in binary constraint satisfaction via forbidden patterns"):
  Abstract: Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value elimination rule) allows the polynomial-time identification of certain variables (domain elements) whose elimination, without the introduction of extra compensatory constraints, does not affect the satisfiability of an instance. We show that there are essentially just four variable elimination rules and three value elimination rules defined by forbidding generic sub-instances, known as irreducible existential patterns, in arc-consistent CSP instances. One of the variable elimination rules is the already-known Broken Triangle Property, whereas the other three are novel. The three value elimination rules can all be seen as strict generalisations of neighbourhood substitution.

Includes members:
  Member "a dichotomy for 2 constraint forbidden csp patterns":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the tractability of csp classes defined by forbidden patterns")
  Member "tractable triangles and cross free convexity in discrete optimisation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a tractable class of binary vcsps via m convex intersection")
  Member "the tractability of csp classes defined by forbidden patterns":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "testing unsatisfiability of constraint satisfaction problems via tensor products")
  Member "hybrid tractable classes of binary quantified constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "variable elimination in binary csps")
  Member "conflict directed backjumping revisited":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "implementing efficient all solutions sat solvers")

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)