human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials"):
  with members:
    - "the matching problem in general graphs is in quasi nc"
    - "reconstruction of real depth 3 circuits with top fan in 2"
    - "progress on polynomial identity testing ii"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "algebraic independence and blackbox identity testing"
    - "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter"

Connected through hyperedge HE-2 (induced by source paper "general linear group action on tensors a candidate for post quantum cryptography"):
  with members:
    - "isomorphism problems for tensors groups and cubic forms completeness and reductions"
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "efficient algorithms for tensor scaling quantum marginals and moment polytopes"
    - "alternating minimization scaling algorithms and the null cone problem from invariant theory"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "solving the isomorphism of polynomials with two secrets problem for all pairs of quadratic forms"
    - "polynomial time algorithms for quadratic isomorphism of polynomials the regular case"

Connected through hyperedge HE-3 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions"):
  with members:
    - "linear algebraic analogues of the graph isomorphism problem and the erd h o s r enyi model"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "the matching problem in general graphs is in quasi nc"
    - "bipartite perfect matching is in quasi nc"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "graph isomorphism in quasipolynomial time"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "non commutative edmonds problem and matrix semi invariants"

Connected through hyperedge HE-4 (induced by source paper "search problems in algebraic complexity gct and hardness of generator for invariant rings"):
  with members:
    - "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"
    - "alternating minimization scaling algorithms and the null cone problem from invariant theory"
    - "no occurrence obstructions in geometric complexity theory"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "circuit complexity proof complexity and polynomial identity testing"

Connected through hyperedge HE-5 (induced by source paper "hyperpfaffians and geometric complexity theory"):
  with members:
    - "search problems in algebraic complexity gct and hardness of generator for invariant rings"

Connected through hyperedge HE-6 (induced by source paper "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"):
  with members:
    - "alternating minimization scaling algorithms and the null cone problem from invariant theory"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "the paulsen problem continuous operator scaling and smoothed analysis"
    - "much faster algorithms for matrix scaling"
    - "matrix scaling and balancing via box constrained newton s method and interior point methods"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics"

Connected through hyperedge HE-7 (induced by source paper "discovering the roots uniform closure results for algebraic classes under factoring"):
  with members:
    - "algebraic dependencies and pspace algorithms in approximative complexity"
    - "the complexity of factors of multivariate polynomials"
    - "small hitting sets for tiny arithmetic circuits or how to turn bad designs into good"
    - "on algebraic branching programs of small width"
    - "a pspace construction of a hitting set for the closure of small algebraic circuits"
    - "arithmetic circuits with locally low algebraic rank"
    - "proof complexity lower bounds from algebraic circuit complexity"
    - "boundaries of vp and vnp"

Connected through hyperedge HE-8 (induced by source paper "a pspace construction of a hitting set for the closure of small algebraic circuits"):
  with members:
    - "the complexity of factors of multivariate polynomials"

Question: Please tell me which class the center node 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)