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 "separating linear forms for bivariate systems"):
  Abstract: We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex) solutions of the system. In other words, a separating linear form defines a shear of the coordinate system that sends the algebraic system in generic position, in the sense that no two distinct solutions are vertically aligned. The computation of such linear forms is at the core of most algorithms that solve algebraic systems by computing rational parameterizations of the solutions and, moreover, the computation a separating linear form is the bottleneck of these algorithms, in terms of worst-case bit complexity. Given two bivariate polynomials of total degree at most $d$ with integer coefficients of bitsize at most~$\tau$, our algorithm computes a separating linear form in $\sOB(d^{8}+d^7\tau)$ bit operations in the worst case, where the previously known best bit complexity for this problem was $\sOB(d^{10}+d^9\tau)$ (where $\sO$ refers to the complexity where polylogarithmic factors are omitted and $O_B$ refers to the bit complexity).

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 "from approximate factorization to root isolation with application to cylindrical algebraic decomposition")
  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 "a worst case bound for topology computation of algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-5 (induced by source paper "on the complexity of computing the topology of real algebraic space curves")
  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 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)