SAT problem is the first NP-complete problem and the nucleus of the category of NP-complete problems.
SAT问题是第一个NP-完全问题,并且是一大类NP-完全问题的核心。
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大团问题是组合优化中的一个经典的NP -完全问题。
The TCNN is extended for solving file assignment problem(FAP), which is of one of the NP-complete problems.
该文还用这种方法求解了属于NP难题的文件分配问题(FAP)。
应用推荐