np完备 meaning in English
np-complete
Examples
- Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局问题是具有np完备计算复杂度的离散组合优化问题。 - The optimum multiuser detection can obtain the best bit error rate theoretice . but its computing complexity increases with the number of users exponentially and belongs to np maturity problem . so much research fasten on the multiuser detection with low computing complexity . cdma multiuser detection is in fact a combination optimize problem
基于最大似然准则的最佳多用户检测器在理论上可以获得最小的误码率,提供最佳的检测性能,但其计算复杂度随用户数呈指数增长,属于np完备问题,因此大量的研究集中于发展计算复杂度较低的次最佳多用户检测器,使其具有合理的计算复杂度。