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 "an fptas for the volume of a cal v polytope it is hard to compute the volume of the intersection of two cross polytopes"):
  Abstract: Given an $n$-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio $(n/\log n)^n$. There is a substantial progress on randomized approximation such as Markov chain Monte Carlo for a high-dimensional volume, and for many #P-hard problems, while some deterministic approximation algorithms are recently developed only for a few #P-hard problems. Motivated by a deterministic approximation of the volume of a ${\cal V}$-polytope, that is a polytope with few vertices and (possibly) exponentially many facets, this paper investigates the volume of a "knapsack dual polytope," which is known to be #P-hard due to Khachiyan (1989). We reduce an approximate volume of a knapsack dual polytope to that of the intersection of two cross-polytopes, and give FPTASs for those volume computations. Interestingly, the volume of the intersection of two cross-polytopes (i.e., $L_1$-balls) is #P-hard, unlike the cases of $L_{\infty}$-balls or $L_2$-balls.

Includes members:
  Member "a fully polynomial time approximation scheme for approximating a sum of random variables":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an fptas for stochastic unbounded min knapsack problem")
  Member "a simple fptas for counting edge covers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "near optimal deterministic algorithms for volume computation via m ellipsoids":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multitype integer monoid optimization and applications")
  Member "correlation decay up to uniqueness in spin systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "approximate counting via correlation decay in spin systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "a deterministic polynomial time approximation scheme for counting knapsack solutions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximate knapsack computations to count semi fair allocations")
  Member "polynomial time approximation schemes for knapsack and related counting problems using branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the distribution function of the longest path length in constant treewidth dags with random edge length")

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)