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 fast algorithm for computing the truncated resultant"):
  Abstract: Let P and Q be two polynomials in K[x,y] with degree at most d, where K is a field. Denoting by R ∈ K[x] the resultant of P and Q with respect to y, we present an algorithm to compute R mod xk in O~(kd) arithmetic operations in K, where the ~O notation indicates that we omit polylogarithmic factors. This is an improvement over state-of-the-art algorithms that require to compute R in O~(d3) operations before computing its first k coefficients.

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 "numeric certified algorithm for the topology of resultant and discriminant curves":
    also connected through other hyperedges:
      (none)
  Member "improved algorithm for computing separating linear forms for bivariate systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (induced by source paper "on the complexity of computing with planar algebraic 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 "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of computing with planar algebraic 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)