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 with quasiseparable matrices"):
  Abstract: The class of quasiseparable matrices is defined by a pair of bounds, called the quasiseparable orders, on the ranks of the sub-matrices entirely located in their strictly lower and upper triangular parts. These arise naturally in applications, as e.g. the inverse of band matrices, and are widely used for they admit structured representations allowing to compute with them in time linear in the dimension. We show, in this paper, the connection between the notion of quasiseparability and the rank profile matrix invariant, presented in [Dumas & al. ISSAC'15]. This allows us to propose an algorithm computing the quasiseparable orders (rL,rU) in time O{n2sω-2} where s=max(rL,rU) and ω the exponent of matrix multiplication. We then present two new structured representations, a binary tree of PLUQ decompositions, and the Bruhat, using respectively O{ns log n/s and O{ns} field elements instead of O{ns2} for the classical generator and O{ns log n} for the hierarchically semiseparable representations. We present algorithms computing these representations in time O{n2sω-2}. These representations allow a matrix-vector product in time linear in the size of their representation. Lastly we show how to multiply two such structured matrices in time O{n2sω-2}.

Includes members:
  Member "fast computation of the rank profile matrix and the generalized bruhat decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "elimination based certificates for triangular equivalence and rank profiles")
  Member "computing the rank profile matrix":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the uniqueness of simultaneous rational function reconstruction")
  Member "simultaneous computation of the row and column rank profiles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "elimination based certificates for triangular equivalence and rank profiles")
  Member "fast generalized bruhat decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "recursive matrix algorithms in commutative domain for cluster with distributed memory")

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)