human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "applications of continuous amortization to bisection based root isolation"):
  Abstract: Continuous amortization is a technique for computing the complexity of algorithms, and it was first presented by the author in Burr, Krahmer, & Yap (2009). Continuous amortization can result in simpler and more straight-forward complexity analyses, and it was used in Burr, Krahmer, & Yap (2009), Burr & Krahmer (2012), and Sharma & Yap (2012) to provide complexity bounds for simple root isolation algorithms. This paper greatly extends the reach of continuous amortization to serve as an overarching technique which can be used to compute complexity of many root isolation techniques in a straight-forward manner. Additionally, the technique of continuous amortization is extended to higher dimensions and to the computation of the bit-complexity of algorithms. In this paper, six continuous amortization calculations are performed to compute complexity bounds (on either the size of the subdivision tree or the bit complexity) for several algorithms (including algorithms based on Sturm sequences, Descartes' rule of signs, and polynomial evaluation); in each case, continuous amortization achieves an optimal complexity bound.

Includes members:
  Member "computing real roots of real polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "alternating minimization based trajectory generation for quadrotor aggressive flight")
  Member "complete subdivision algorithms ii isotopic meshing of singular algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "visualizing planar and space implicit real algebraic curves with singularities")
  Member "sqfreeeval an almost optimal real root isolation algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of subdivision for diameter distance tests")
  Member "on the complexity of real root isolation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing real roots of real polynomials")

Question: Please tell me which class the source paper 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.DS(Data Structures and Algorithms)