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 "on the complexity of computing with planar algebraic curves"):
  Abstract: In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in \mathbb{Z}[x,y]$, each of total degree less than $n$ and with integer coefficients of absolute value less than $2^\tau$, we show that each of the following problems can be solved in a deterministic way with a number of bit operations bounded by $\tilde{O}(n^6+n^5\tau)$, where we ignore polylogarithmic factors in $n$ and $\tau$: #R##N#(1) The computation of isolating regions in $\mathbb{C}^2$ for all complex solutions of the system $f = g = 0$, #R##N#(2) the computation of a separating form for the solutions of $f = g = 0$, #R##N#(3) the computation of the sign of $h$ at all real valued solutions of $f = g = 0$, and #R##N#(4) the computation of the topology of the planar algebraic curve $\mathcal{C}$ defined as the real valued vanishing set of the polynomial $f$. #R##N#Our bound improves upon the best currently known bounds for the first three problems by a factor of $n^2$ or more and closes the gap to the state-of-the-art randomized complexity for the last problem.

Includes members:
  Member "improved algorithm for computing separating linear forms for bivariate systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a fast algorithm for computing the truncated resultant")
  Member "fast approximate polynomial multipoint evaluation and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast and rigorous arbitrary precision computation of gauss legendre quadrature nodes and weights")
  Member "a generic position based method for real root isolation of zero dimensional polynomial systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of computing the topology of real algebraic space curves")
  Member "rational univariate representations of bivariate systems and applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the complexity of computing the topology of real algebraic space curves")
  Member "from approximate factorization to root isolation with application to cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  Member "separating linear forms for bivariate systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a fast algorithm for computing the truncated resultant")
  Member "exact symbolic numeric computation of planar algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "counting solutions of a polynomial system locally and exactly")
  Member "a worst case bound for topology computation of algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "from approximate factorization to root isolation with application to cylindrical algebraic decomposition")

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.SC(Symbolic Computation)