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 "solving determinantal systems using homotopy techniques"):
  Abstract: Let $\K$ be a field of characteristic zero and $\Kbar$ be an  algebraic closure of $\K$. Consider a sequence of polynomials#R##N#$G=(g_1,\dots,g_s)$ in $\K[X_1,\dots,X_n]$, a polynomial matrix $\F=[f_{i,j}] \in \K[X_1,\dots,X_n]^{p \times q}$, with $p \leq q$,#R##N#and the algebraic set $V_p(F, G)$ of points in $\KKbar$ at  which all polynomials in $\G$ and all $p$-minors of $\F$#R##N#vanish. Such polynomial systems appear naturally in e.g. polynomial optimization, computational geometry.#R##N##R##N#We provide bounds on the number of isolated points in $V_p(F, G)$ depending on the maxima of the degrees in rows (resp. columns) of  $\F$. Next, we design homotopy algorithms for computing those points. These algorithms take advantage of the determinantal structure of the system defining $V_p(F, G)$. In particular, the algorithms run in time that is  polynomial in the bound on the number of isolated points.

Includes members:
  Member "critical point computations on smooth varieties degree and complexity bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a special homotopy continuation method for a class of polynomial systems")
  Member "a polyhedral method to compute all affine solution sets of sparse polynomial systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "solving polynomial systems in the cloud with polynomial homotopy continuation")
  Member "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing the volume of compact semi algebraic sets")
  Member "probabilistic algorithm for polynomial optimization over a real algebraic set":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "real root finding for equivariant semi algebraic systems")
  Member "critical points and gr obner bases the unmixed case":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization")
  Member "on the complexity of the generalized minrank problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of minrank")

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)