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 "computing real roots of real polynomials"):
  Abstract: Computing the roots of a univariate polynomial is a fundamental and long-studied problem of computational algebra with applications in mathematics, engineering, computer science, and the natural sciences. For isolating as well as for approximating all complex roots, the best algorithm known is based on an almost optimal method for approximate polynomial factorization, introduced by Pan in 2002. Pan's factorization algorithm goes back to the splitting circle method from Schoenhage in 1982. The main drawbacks of Pan's method are that it is quite involved and that all roots have to be computed at the same time. For the important special case, where only the real roots have to be computed, much simpler methods are used in practice; however, they considerably lag behind Pan's method with respect to complexity. #R##N#In this paper, we resolve this discrepancy by introducing a hybrid of the Descartes method and Newton iteration, denoted ANEWDSC, which is simpler than Pan's method, but achieves a run-time comparable to it. Our algorithm computes isolating intervals for the real roots of any real square-free polynomial, given by an oracle that provides arbitrary good approximations of the polynomial's coefficients. ANEWDSC can also be used to only isolate the roots in a given interval and to refine the isolating intervals to an arbitrary small size; it achieves near optimal complexity for the latter task.

Includes members:
  Member "on the complexity of computing with planar algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  Member "a near optimal algorithm for computing real roots of sparse polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficiently computing real roots of sparse polynomials")
  Member "fast approximate polynomial multipoint evaluation and applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast and rigorous arbitrary precision computation of gauss legendre quadrature nodes and weights")
  Member "from approximate factorization to root isolation with application to cylindrical algebraic decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  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-5 (induced by source paper "on the complexity of computing the topology of real algebraic space curves")
  Member "root refinement for real polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fast approximate polynomial multipoint evaluation and applications")
  Member "sqfreeeval an almost optimal real root isolation algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of subdivision for diameter distance tests")
  Member "on the complexity of real root isolation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "applications of continuous amortization to bisection based root isolation")

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)