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 "a worst case bound for topology computation of algebraic curves"):
  Abstract: Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with coefficients bounded by $2^\rho$, the topology of the induced curve can be computed with $\tilde{O}(n^8(n+\rho^2))$ bit operations deterministically, and with $\tilde{O}(n^8\rho^2)$ bit operations with a randomized algorithm in expectation. Our analysis improves previous best known complexity bounds by a factor of $n^2$. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and by the consequent amortized analysis of the critical fibers of the algebraic curve.

Includes members:
  Member "arrangement computation for planar algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of computing the topology of real algebraic space curves")
  Member "complete subdivision algorithms ii isotopic meshing of singular algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "visualizing planar and space implicit real algebraic curves with singularities")
  Member "root refinement for real polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing real roots of real polynomials")
  Member "on the complexity of real root isolation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing real roots of real polynomials")
  Member "on the asymptotic and practical complexity of solving bivariate systems over the reals":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of computing the topology of real algebraic space curves")

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)