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 "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants"):
  Abstract: Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of the practical impact of these algorithms, e.g. on applications such as decoding some error-correcting codes and solving polynomial systems or structured linear systems. In this paper, we discuss implementation aspects for most fundamental operations: multiplication, truncated inversion, approximants, interpolants, kernels, linear system solving, determinant, and basis reduction. We focus on prime fields with a word-size modulus, relying on Shoup's C++ library NTL. Combining these new tools to implement variants of Villard's algorithm for the resultant of generic bivariate polynomials (ISSAC 2018), we get better performance than the state of the art for large parameters.

Includes members:
  Member "computing popov and hermite forms of rectangular polynomial matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interactive certificates for polynomial matrices with sub linear communication")
  Member "fast computation of approximant bases in canonical form":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a divide and conquer algorithm for computing grobner bases of syzygies in finite dimension")
  Member "block krylov techniques in the context of sparse fglm algorithms":
    also connected through other hyperedges:
      (none)
  Member "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "fast computation of minimal interpolation bases in popov form for arbitrary shifts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a divide and conquer algorithm for computing grobner bases of syzygies in finite dimension")
  Member "fast deterministic computation of the hermite normal form and determinant of a polynomial matrix":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sensitive distance and reachability oracles for large batch updates")
  Member "sub quadratic decoding of one point hermitian codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "power error locating pairs")
  Member "computing minimal interpolation bases":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a divide and conquer algorithm for computing grobner bases of syzygies in finite dimension")

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)