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 "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"):
  Abstract: We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also works for polynomials with multiple roots provided that the number $k$ of distinct roots is given as part of the input. It outputs $k$ pairwise disjoint disks each containing one of the distinct roots of $p$, and its multiplicity. The algorithm uses approximate factorization as a subroutine. #R##N#In addition, we apply the new root isolation algorithm to a recent algorithm for computing the topology of a real planar algebraic curve specified as the zero set of a bivariate integer polynomial and for isolating the real solutions of a bivariate polynomial system. For input polynomials of degree $n$ and bitsize $\tau$, we improve the currently best running time from $\tO(n^{9}\tau+n^{8}\tau^{2})$ (deterministic) to $\tO(n^{6}+n^{5}\tau)$ (randomized) for topology computation and from $\tO(n^{8}+n^{7}\tau)$ (deterministic) to $\tO(n^{6}+n^{5}\tau)$ (randomized) for solving bivariate systems.

Includes members:
  Member "solving bivariate systems efficient worst case algorithm for computing rational univariate representations and applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "separating linear forms for bivariate systems")
  Member "rational univariate representations of bivariate systems and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of computing the topology of real algebraic space curves")
  Member "separating linear forms for bivariate systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-5 (induced by source paper "on the complexity of computing with planar algebraic curves")
  Member "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of computing the topology of real algebraic space curves")
  Member "on the complexity of solving a bivariate polynomial system":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the complexity of computing the topology of real algebraic space curves")
  Member "sqfreeeval an almost optimal real root isolation algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complexity of subdivision for diameter distance tests")

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)