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 solving zero dimensional polynomial systems via projection"):
  Abstract: Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l with coefficients of small bit size. For computing l, we need to project the solutions into one dimension along O(n) distinct directions but no further algebraic manipulations. The solutions are then directly reconstructed from the considered projections. The first step is deterministic, whereas the second step uses randomization, thus being Las-Vegas. #R##N#The theoretical analysis of our approach shows that the overall cost for the two problems considered above is dominated by the cost of carrying out the projections. We also give bounds on the bit complexity of our algorithms that are exclusively stated in terms of the number of variables, the total degree and the bitsize of the input polynomials.

Includes members:
  Member "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new progress in univariate polynomial root finding")
  Member "on the complexity of computing with planar algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  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 "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 "root isolation of zero dimensional polynomial systems with linear univariate representation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of subdivision for diameter distance tests")
  Member "the dmm bound multivariate aggregate separation bounds":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "symbolic numeric tools for analytic combinatorics in several variables")
  Member "on the asymptotic and practical complexity of solving bivariate systems over the reals":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)