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 "most tensor problems are np hard"):
  Abstract: We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor possesses a given eigenvalue, singular value, or spectral norm; approximating an eigenvalue, eigenvector, singular vector, or the spectral norm; and determining the rank or best rank-1 approximation of a 3-tensor. Furthermore, we show that restricting these problems to symmetric tensors does not alleviate their NP-hardness. We also explain how deciding nonnegative definiteness of a symmetric 4-tensor is NP-hard and how computing the combinatorial hyperdeterminant of a 4-tensor is NP-, #P-, and VNP-hard. We shall argue that our results provide another view of the boundary separating the computational tractability of linear/convex problems from the intractability of nonlinear/nonconvex ones.

Includes members:
  Member "computing a nonnegative matrix factorization provably":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convergence to second order stationarity for non negative matrix factorization provably and concurrently")
  Member "random tensors and planted cliques":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal average case reductions to sparse pca from weak assumptions to strong hardness")
  Member "the multivariate resultant is np hard in any characteristic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of the multivariate resultant")
  Member "fast integer multiplication using modular arithmetic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "faster integer multiplication using short lattice vectors")
  Member "on the complexity of nonnegative matrix factorization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "convergence to second order stationarity for non negative matrix factorization provably and concurrently")
  Member "complexity limitations on quantum computation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity limitations on one turn quantum refereed games")

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)