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: "the multivariate resultant is np hard in any characteristic"
  Abstract: The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the system's coefficients which vanishes if and only if the system is satisfiable). In this paper we present several NP-hardness results for testing whether a multivariate resultant vanishes, or equivalently for deciding whether a square system of homogeneous equations is satisfiable. Our main result is that testing the resultant for zero is NP-hard under deterministic reductions in any characteristic, for systems of low-degree polynomials with coefficients in the ground field (rather than in an extension). We also observe that in characteristic zero, this problem is in the Arthur-Merlin class AM if the generalized Riemann hypothesis holds true. In positive characteristic, the best upper bound remains PSPACE.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of the multivariate resultant"):
  with members:
    - "vpspace and a transfer theorem over the reals"

Connected through hyperedge HE-2 (induced by source paper "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"):
  with members:
    - "the complexity of factors of multivariate polynomials"
    - "unifying known lower bounds via geometric complexity theory"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "new lower bounds for the rank of matrix multiplication"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "quasi polynomial hitting set for set depth delta formulas"
    - "arithmetic circuits the chasm at depth four gets wider"
    - "geometric complexity theory vi the flip via saturated and positive integer programming in representation theory and algebraic geometry"

Connected through hyperedge HE-3 (induced by source paper "geometric complexity theory v efficient algorithms for noether normalization"):
  with members:
    - "the complexity of factors of multivariate polynomials"
    - "unifying known lower bounds via geometric complexity theory"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"
    - "arithmetic circuits and the hadamard product of polynomials"
    - "geometric complexity theory iv nonstandard quantum group for the kronecker problem"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-4 (induced by source paper "most tensor problems are np hard"):
  with members:
    - "computing a nonnegative matrix factorization provably"
    - "random tensors and planted cliques"
    - "fast integer multiplication using modular arithmetic"
    - "on the complexity of nonnegative matrix factorization"
    - "complexity limitations on quantum computation"

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)