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 "restricted parameter range promise set cover problems are easy"):
  Abstract: Let $({\bf U},{\bf S},d)$ be an instance of Set Cover Problem, where ${\bf U}=\{u_1,...,u_n\}$ is a $n$ element ground set, ${\bf S}=\{S_1,...,S_m\}$ is a set of $m$ subsets of ${\bf U}$ satisfying $\bigcup_{i=1}^m S_i={\bf U}$ and $d$ is a positive integer. In STOC 1993 M. Bellare, S. Goldwasser, C. Lund and A. Russell proved the NP-hardness to distinguish the following two cases of ${\bf GapSetCover_{\eta}}$ for any constant $\eta > 1$. The Yes case is the instance for which there is an exact cover of size $d$ and the No case is the instance for which any cover of ${\bf U}$ from ${\bf S}$ has size at least $\eta d$. This was improved by R. Raz and S. Safra in STOC 1997 about the NP-hardness for ${\bf GapSetCover}_{clogm}$ for some constant $c$. In this paper we prove that restricted parameter range subproblem is easy. For any given function of $n$ satisfying $\eta(n) \geq 1$, we give a polynomial time algorithm not depending on $\eta(n)$ to distinguish between #R##N#{\bf YES:} The instance $({\bf U},{\bf S}, d)$ where $d>\frac{2 |{\bf S}|}{3\eta(n)-1}$, for which there exists an exact cover of size at most $d$; #R##N#{\bf NO:} The instance $({\bf U},{\bf S}, d)$ where $d>\frac{2 |{\bf S}|}{3\eta(n)-1}$, for which any cover from ${\bf S}$ has size larger than $\eta(n) d$. #R##N#The polynomial time reduction of this restricted parameter range set cover problem is constructed by using the lattice.

Includes members:
  Member "tensor based hardness of the shortest vector problem to within almost polynomial factors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hardness of bounded distance decoding on lattices in ell_p norms")
  Member "a new multilayered pcp and the hardness of hypergraph vertex cover":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an improved algorithm for dynamic set cover")

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)