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 "sherali adams relaxations for valued csps"):
  Abstract: We consider Sherali-Adams linear programming relaxations for solving valued constraint satisfaction problems to optimality. The utility of linear programming relaxations in this context have previously been demonstrated using the lowest possible level of this hierarchy under the name of the basic linear programming relaxation (BLP). It has been shown that valued constraint languages containing only finite-valued weighted relations are tractable if, and only if, the integrality gap of the BLP is 1. In this paper, we demonstrate that almost all of the known tractable languages with arbitrary weighted relations have an integrality gap 1 for the Sherali-Adams relaxation with parameters (2, 3). The result is closely connected to the notion of bounded relational width for the ordinary constraint satisfaction problem and its recent characterisation.

Includes members:
  Member "necessary conditions for tractability of valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "representing fitness landscapes by valued constraints to understand the complexity of local search")
  Member "algebraic properties of valued constraint satisfaction problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "local distribution and the symmetry gap approximability of multiway partitioning problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimizing item and subgroup configurations for social aware vr shopping")
  Member "the complexity of conservative valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "representing fitness landscapes by valued constraints to understand the complexity of local search")
  Member "the power of linear programming for general valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "graphical models and belief propagation hierarchy for physics constrained network flows")
  Member "the power of linear programming for valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "piecewise linear valued csps solvable by linear programming relaxation")
  Member "an effective fusion technique of cloud computing and networking series":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "binarisation for valued constraint satisfaction problems")
  Member "extensions of the minimum cost homomorphism problem":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "binarisation for valued constraint satisfaction problems")

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)