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 asymptotic and practical complexity of solving bivariate systems over the reals"
  Abstract: This paper is concerned with exact real solving of well-constrained, bivariate polynomial systems. The main problem is to isolate all common real roots in rational rectangles, and to determine their intersection multiplicities. We present three algorithms and analyze their asymptotic bit complexity, obtaining a bound of [email protected]?"B(N^1^4) for the purely projection-based method, and [email protected]?"B(N^1^2) for two subresultant-based methods: this notation ignores polylogarithmic factors, where N bounds the degree, and the bitsize of the polynomials. The previous record bound was [email protected]?"B(N^1^4). Our main tool is signed subresultant sequences. We exploit recent advances on the complexity of univariate root isolation, and extend them to sign evaluation of bivariate polynomials over algebraic numbers, and real root counting for polynomials over an extension field. Our algorithms apply to the problem of simultaneous inequalities; they also compute the topology of real plane algebraic curves in [email protected]?"B(N^1^2), whereas the previous bound was [email protected]?"B(N^1^4). All algorithms have been implemented in maple, in conjunction with numeric filtering. We compare them against fgb/rs, system solvers from synaps, and maple libraries insulate and top, which compute curve topology. Our software is among the most robust, and its runtimes are comparable, or within a small constant factor, with respect to the C/C++ libraries.

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 complexity of solving a bivariate polynomial system"

Connected through hyperedge HE-2 (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"
    - "on the complexity of solving a bivariate polynomial system"
    - "root isolation of zero dimensional polynomial systems with linear univariate representation"
    - "the dmm bound multivariate aggregate separation bounds"

Connected through hyperedge HE-3 (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-4 (induced by source paper "improved algorithm for computing separating linear forms for bivariate systems"):
  with members:
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"

Connected through hyperedge HE-5 (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"
    - "on the complexity of solving a bivariate polynomial system"
    - "sqfreeeval an almost optimal real root isolation algorithm"

Connected through hyperedge HE-6 (induced by source paper "a generic position based method for real root isolation of zero dimensional polynomial systems"):
  with members:
    - "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"
    - "on the complexity of solving a bivariate polynomial system"
    - "root isolation of zero dimensional polynomial systems with linear univariate representation"
    - "parallel computation of real solving bivariate polynomial systems by zero matching method"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"

Connected through hyperedge HE-7 (induced by source paper "separating linear forms for bivariate systems"):
  with members:
    - "solving bivariate systems efficient worst case algorithm for computing rational univariate representations and applications"
    - "rational univariate representations of bivariate systems and applications"
    - "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"
    - "on the complexity of solving a bivariate polynomial system"

Connected through hyperedge HE-8 (induced by source paper "rational univariate representations of bivariate systems and applications"):
  with members:
    - "separating linear forms for bivariate systems"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "on the complexity of solving a bivariate polynomial system"

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)