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: "univariate real root isolation in an extension field"
  Abstract: We present algorithmic, complexity and implementation results for the problem of isolating the real roots of a univariate polynomial in $B_{\alpha} \in L[y]$, where $L=\QQ(\alpha)$ is a simple algebraic extension of the rational numbers. We consider two approaches for tackling the problem. In the first approach using resultant computations we perform a reduction to a polynomial with integer coefficients. We compute separation bounds for the roots, and using them we deduce that we can isolate the real roots of $B_{\alpha}$ in $\sOB(N^{10})$, where $N$ is an upper bound on all the quantities (degree and bitsize) of the input polynomials. In the second approach we isolate the real roots working directly on the polynomial of the input. We compute improved separation bounds for real roots and we prove that they are optimal, under mild assumptions. For isolating the roots we consider a modified Sturm's algorithm, and a modified version of \func{descartes}' algorithm introduced by Sagraloff. For the former we prove a complexity bound of $\sOB(N^8)$ and for the latter a bound of $\sOB(N^{7})$. We implemented the algorithms in \func{C} as part of the core library of \mathematica and we illustrate their efficiency over various data sets. Finally, we present complexity results for the general case of the first approach, where the coefficients belong to multiple extensions.

Connected through hyperedge HE-1 (induced by source paper "algorithms for weighted sums of squares decomposition of non negative univariate polynomials"):
  with members:
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "formal proofs for nonlinear optimization"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"

Connected through hyperedge HE-2 (induced by source paper "nearly optimal computations with structured matrices"):
  with members:
    - "fast approximate polynomial multipoint evaluation and applications"
    - "the dmm bound multivariate aggregate separation bounds"

Connected through hyperedge HE-3 (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-4 (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"
    - "the dmm bound multivariate aggregate separation bounds"
    - "on the complexity of real root isolation"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"
    - "fast multipoint evaluation of bivariate polynomials"

Connected through hyperedge HE-5 (induced by source paper "on the complexity of real root isolation"):
  with members:
    - "a worst case bound for topology computation of algebraic curves"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"
    - "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.SC(Symbolic Computation)