How to prove a optimization problem is NP-hard, especially when co-channel interference is considered. I will be greatly grateful that someone could give me an example. It will be better if the example is in non-orthogonal multiple access (NOMA) scenarios.
Fernando Lobo Pimentel
The following link can be helpful to you:
https://cs.stackexchange.com/questions/19228/np-hard-proof-polynomial-time-reduction
Good luck.
1 votes
0 thanks
Joel Antonio Trejo-Sánchez
Maybe this notes can help you.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2012/lecture-notes/MIT6_046JS12_lec17.pdf
1 votes
1 thanks
- Badges
- Science topic
- Similar topics
- Mathematics
- Applied Mathematics
Similar questions and discussions