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: "fast approximate polynomial multipoint evaluation and applications"
  Abstract: It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial F 2 C[x] of degree n at n complex-valued points can be done with ~ O(n) exact eld operations in C; where ~ O( ) means that we omit polylogarithmic factors. We complement this result by an analysis of approximate multipoint evaluation of F to a precision of L bits after the binary point and prove a bit complexity of ~ O(n(L + +n)) ; where 2 and 2 ; with ; 2 N 1; are bounds on the magnitude of the coecients of F and the evaluation points, respectively. In particular, in the important case where the precision demand dominates the other input parameters, the complexity is soft-linear in n and L: Our result on approximate multipoint evaluation has some interesting consequences on the bit complexity of three further approximation algorithms which all use polynomial evaluation as a key subroutine. This comprises an algorithm to approximate the real roots of a polynomial, an algorithm for polynomial interpolation, and a method for computing a Taylor shift of a polynomial. For all of the latter algorithms, we derive near optimal running times.

Connected through hyperedge HE-1 (induced by source paper "fast and rigorous arbitrary precision computation of gauss legendre quadrature nodes and weights"):
  with members:
    - "computing hypergeometric functions rigorously"
    - "evaluating parametric holonomic sequences using rectangular splitting"

Connected through hyperedge HE-2 (induced by source paper "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"):
  with members:
    - "computing real roots of real polynomials and now for real"
    - "a near optimal algorithm for computing real roots of sparse polynomials"
    - "computing real roots of real polynomials"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "accelerated approximation of the complex roots and factors of a univariate polynomial"):
  with members:
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"

Connected through hyperedge HE-4 (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"
    - "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"
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"

Connected through hyperedge HE-5 (induced by source paper "accelerated approximation of the complex roots of a univariate polynomial extended abstract"):
  with members:
    - "nearly optimal computations with structured matrices"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"

Connected through hyperedge HE-6 (induced by source paper "nearly optimal computations with structured matrices"):
  with members:
    - "univariate real root isolation in an extension field"
    - "the dmm bound multivariate aggregate separation bounds"

Connected through hyperedge HE-7 (induced by source paper "computing real roots of real polynomials"):
  with members:
    - "on the complexity of computing with planar algebraic curves"
    - "a near optimal algorithm for computing real roots of sparse polynomials"
    - "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"
    - "root refinement for real polynomials"
    - "sqfreeeval an almost optimal real root isolation algorithm"
    - "on the complexity of real root isolation"

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.NA(Numerical Analysis)