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 "detecting simultaneous integer relations for several real vectors"):
  Abstract: An algorithm which either finds an nonzero integer vector m for given t real n-dimensional vectors x1,��� , xt such that x T m = 0 or proves that no such integer vector with norm less than a given bound exists is presented in this paper. The cost of the algorithm is at mostO(n 4 + n 3 log�(X)) exact arithmetic operations in dimension n and the least Euclidean norm�(X) of such integer vectors. It matches the best complexity upper bound known for this problem. Experimental data show that the algorithm is better than an already existi ng algorithm in the literature. In application, the algorit hm is used to get a complete method for finding the minimal polyno mial of an unknown complex algebraic number from its approximation, which runs even faster than the corresponding Maple built-in function.

Includes members:
  Member "gradual sub lattice reduction and a new complexity for factoring polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of computing all subfields of an algebraic number field")
  Member "finding exact minimal polynomial by approximations":
    also connected through other hyperedges:
      (none)

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.SC(Symbolic Computation)