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 "geometric complexity theory v efficient algorithms for noether normalization"):
  Abstract: We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized polynomial-time Monte Carlo algorithm for this problem. For some interesting cases of explicit varieties, we give deterministic quasi-polynomial time algorithms. These may be contrasted with the standard EXPSPACE-algorithms for these problems in computational algebraic geometry. #R##N#In particular, we show that: #R##N#(1) The categorical quotient for any finite dimensional representation $V$ of $SL_m$, with constant $m$, is explicit in characteristic zero. #R##N#(2) NNL for this categorical quotient can be solved deterministically in time quasi-polynomial in the dimension of $V$. #R##N#(3) The categorical quotient of the space of $r$-tuples of $m \times m$ matrices by the simultaneous conjugation action of $SL_m$ is explicit in any characteristic. #R##N#(4) NNL for this categorical quotient can be solved deterministically in time quasi-polynomial in $m$ and $r$ in any characteristic $p$ not in $[2,\ m/2]$. #R##N#(5) NNL for every explicit variety in zero or large enough characteristic can be solved deterministically in quasi-polynomial time, assuming the hardness hypothesis for the permanent in geometric complexity theory. #R##N#The last result leads to a geometric complexity theory approach to put NNL for every explicit variety in P.

Includes members:
  Member "the complexity of factors of multivariate polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algebraic branching programs border complexity and tangent spaces")
  Member "unifying known lower bounds via geometric complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "succinct hitting sets and barriers to proving algebraic circuits lower bounds")
  Member "explicit noether normalization for simultaneous conjugation via polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials")
  Member "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "derandomization and absolute reconstruction for sums of powers of linear forms")
  Member "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions")
  Member "arithmetic circuits and the hadamard product of polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on explicit branching programs for the rectangular determinant and permanent polynomials")
  Member "the multivariate resultant is np hard in any characteristic":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the complexity of the multivariate resultant")
  Member "geometric complexity theory iv nonstandard quantum group for the kronecker problem":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on vanishing of kronecker coefficients")

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.CC(Computational Complexity)