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 a bivariate polynomial system"):
  Abstract: We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm BISOLVE. BISOLVE is a classical elimination method which first projects the solutions of a system onto the $x$- and $y$-axes and, then, selects the actual solutions from the so induced candidate set. However, unlike similar algorithms, BISOLVE requires no genericity assumption on the input nor it needs any change of the coordinate system. Furthermore, extensive benchmarks from \cite{bes-bisolve-2011} confirm that the algorithm outperforms state of the art approaches by a large factor. In this work, we show that, for two polynomials $f,g\in\mathbb{Z}[x,y]$ of total degree at most $n$ with integer coefficients bounded by $2^\tau$, BISOLVE computes isolating boxes for all real solutions of the system $f=g=0$ using $\Otilde(n^8\tau^{2})$ bit operations, thereby improving the previous record bound by a factor of at least $n^{2}$.

Includes members:
  Member "a worst case bound for topology computation of algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of computing with planar algebraic curves")
  Member "arrangement computation for planar algebraic curves":
    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 "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial":
    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 "univariate real root isolation in an extension field":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algorithms for weighted sums of squares decomposition of non negative univariate polynomials")
  Member "the dmm bound multivariate aggregate separation bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of solving zero dimensional polynomial systems via projection")
  Member "on the complexity of real root isolation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing real roots of real polynomials")
  Member "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a fast algorithm for computing the truncated resultant")
  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)