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 the topology of real algebraic space curves"):
  Abstract: In this paper, we present a deterministic algorithm to find a strong generic position for an algebraic space curve. We modify our existing algorithm for computing the topology of an algebraic space curve and analyze the bit complexity of the algorithm. It is $\tilde{\mathcal {O}} (N^{20})$, where $N=\max\{d,\tau\}$, $d, \tau$ are the degree bound and the bit size bound of the coefficients of the defining polynomials of the algebraic space curve. To our knowledge, this is the best bound among the existing work. It gains the existing results at least $N^2$.

Includes members:
  Member "a generic position based method for real root isolation of zero dimensional polynomial systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of computing with planar algebraic curves")
  Member "rational univariate representations of bivariate systems and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a fast algorithm for computing the truncated resultant")
  Member "arrangement computation for planar algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exact symbolic numeric computation of 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-4 (induced by source paper "the complexity of subdivision for diameter distance tests")
  Member "on the complexity of solving a bivariate polynomial system":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity of a root clustering algorithm")
  Member "on the asymptotic and practical complexity of solving bivariate systems over the reals":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of solving zero dimensional polynomial systems via projection")

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)