human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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}$.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of computing the topology of real algebraic space curves"):
  with members:
    - "a generic position based method for real root isolation of zero dimensional polynomial systems"
    - "rational univariate representations of bivariate systems and applications"
    - "arrangement computation for planar algebraic curves"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-2 (induced by source paper "complexity of a root clustering algorithm"):
  with members:
    - "arb efficient arbitrary precision midpoint radius interval arithmetic"
    - "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"

Connected through hyperedge HE-3 (induced by source paper "on the complexity of solving zero dimensional polynomial systems via projection"):
  with members:
    - "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"
    - "on the complexity of computing with planar algebraic curves"
    - "powers of tensors and fast matrix multiplication"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "root isolation of zero dimensional polynomial systems with linear univariate representation"
    - "the dmm bound multivariate aggregate separation bounds"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-4 (induced by source paper "a fast algorithm for computing the truncated resultant"):
  with members:
    - "on the complexity of computing with planar algebraic curves"
    - "numeric certified algorithm for the topology of resultant and discriminant curves"
    - "improved algorithm for computing separating linear forms for bivariate systems"
    - "rational univariate representations of bivariate systems and applications"
    - "separating linear forms for bivariate systems"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"

Connected through hyperedge HE-5 (induced by source paper "on the complexity of computing with planar algebraic curves"):
  with members:
    - "improved algorithm for computing separating linear forms for bivariate systems"
    - "fast approximate polynomial multipoint evaluation and applications"
    - "a generic position based method for real root isolation of zero dimensional polynomial systems"
    - "rational univariate representations of bivariate systems and applications"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "separating linear forms for bivariate systems"
    - "exact symbolic numeric computation of planar algebraic curves"
    - "a worst case bound for topology computation of algebraic curves"

Connected through hyperedge HE-6 (induced by source paper "a near optimal algorithm for computing real roots of sparse polynomials"):
  with members:
    - "rational univariate representations of bivariate systems and applications"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "sqfreeeval an almost optimal real root isolation algorithm"
    - "the dmm bound multivariate aggregate separation bounds"

Connected through hyperedge HE-7 (induced by source paper "numeric certified algorithm for the topology of resultant and discriminant curves"):
  with members:
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"
    - "explicit factors of some iterated resultants and discriminants"

Connected through hyperedge HE-8 (induced by source paper "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"):
  with members:
    - "solving bivariate systems efficient worst case algorithm for computing rational univariate representations and applications"
    - "rational univariate representations of bivariate systems and applications"
    - "separating linear forms for bivariate systems"
    - "exact symbolic numeric computation of planar algebraic curves"
    - "a worst case bound for topology computation of algebraic curves"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "sqfreeeval an almost optimal real root isolation algorithm"
    - "univariate real root isolation in an extension field"

Question: Please tell me which class the center node 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)