Based on this equivalent definition of NP , another randomized complexity class is given: SUPER NP .
基于此等价定义，定义了另一个随机复杂性类：SUPER NP 。
2
The channel assignment problem belongs to the class of NP complete optimization problems, so we propose a new fixed channel assignment approach based on genetic algorithms.
信道分配问题属于组合优化中的NP完备问题，为此在遗传算法的基础上提出了一种新的固定信道分配方法。
3
SAT problem belongs to the NPclass, that is, theoretically it can't be solved in polynomial time and solving it exceeds the capability of modern computer.