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: "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"
  Abstract: We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of points. First, the amount of purely symbolic operations is significantly reduced, that is, only resultant computation and square-free factorization is still needed. Second, our algorithm neither assumes generic position of the input system nor demands for any change of the coordinate system. The latter is due to a novel inclusion predicate to certify that a certain region is isolating for a solution. Our implementation exploits graphics hardware to expedite the resultant computation. Furthermore, we integrate a number of filtering techniques to improve the overall performance. Efficiency of the proposed method is proven by a comparison of our implementation with two state-of-the-art implementations, that is, LPG and Maple's isolate. For a series of challenging benchmark instances, experiments show that our implementation outperforms both contestants.

Connected through hyperedge HE-1 (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"
    - "on the complexity of solving a bivariate polynomial system"

Connected through hyperedge HE-2 (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-3 (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"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-4 (induced by source paper "exact symbolic numeric computation of planar algebraic curves"):
  with members:
    - "arrangement computation for planar algebraic curves"
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"
    - "on the complexity of solving a bivariate polynomial system"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-5 (induced by source paper "on the complexity of solving a bivariate polynomial system"):
  with members:
    - "a worst case bound for topology computation of algebraic curves"
    - "arrangement computation for planar algebraic curves"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "univariate real root isolation in an extension field"
    - "the dmm bound multivariate aggregate separation bounds"
    - "on the complexity of real root isolation"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"
    - "fast multipoint evaluation of bivariate polynomials"

Connected through hyperedge HE-6 (induced by source paper "root refinement for real polynomials"):
  with members:
    - "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 real root isolation"

Connected through hyperedge HE-7 (induced by source paper "arrangement computation for planar algebraic curves"):
  with members:
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"

Connected through hyperedge HE-8 (induced by source paper "on the complexity of real root isolation"):
  with members:
    - "a worst case bound for topology computation of algebraic curves"
    - "univariate real root isolation in an extension field"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

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.MS(Mathematical Software)