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 "optimal joint subcarrier and power allocation in noma is strongly np hard"):
  Abstract: Non-orthogonal multiple access (NOMA) is a promising radio access technology for 5G. It allows several users to transmit on the same frequency and time resource by performing power- domain multiplexing. At the receiver side, successive interference cancellation (SIC) is applied to mitigate interference among the multiplexed signals. In this way, NOMA can outperform orthogonal multiple access schemes used in conventional cellular networks in terms of spectral efficiency and allows more simultaneous users. This paper investigates the computational complexity of joint subcarrier and power allocation problems in multi-carrier NOMA systems. We prove that these problems are strongly NP-hard for a large class of objective functions, namely the weighted generalized means of the individual data rates. This class covers the popular weighted sum-rate, proportional fairness, harmonic mean and max-min fairness utilities. Our results show that the optimal power and subcarrier allocation cannot be computed in polynomial time in the general case, unless P = NP. Nevertheless, we present some tractable special cases and we show that they can be solved efficiently.

Includes members:
  Member "power and channel allocation for non orthogonal multiple access in 5g systems tractability and computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "non orthogonal multiple access noma how it meets 5g and beyond")
  Member "complexity analysis of joint subcarrier and power allocation for the cellular downlink ofdma system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weighted sum rate maximization in multi carrier noma with cellular power constraint")
  Member "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance analysis of intelligent reflecting surface assisted noma networks")
  Member "on the complexity of joint subcarrier and power allocation for multi user ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "harq cc enabled noma designs with outage probability constraints")

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)