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 "computing the characteristic polynomial of a finite rank two drinfeld module"):
  Abstract: Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We compare their asymptotic complexity to that of previous algorithms given by Gekeler, Narayanan and Garai-Papikian and discuss their practical behavior. In particular, we find that all three approaches represent either an improvement in complexity or an expansion of the parameter space over which the algorithm may be applied. Some experimental results are also presented.

Includes members:
  Member "fast multiplication for skew polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "drinfeld modules with complex multiplication hasse invariants and factoring polynomials over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "toward an optimal quantum algorithm for polynomial factorization over finite fields")
  Member "fast deterministic computation of the hermite normal form and determinant of a polynomial matrix":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants")
  Member "fast operations on linearized polynomials and their applications in coding theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "polynomial factorization over finite fields by computing euler poincare characteristics of drinfeld modules":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algebraic problems equivalent to beating exponent 3 2 for polynomial factorization over finite fields")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")

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)