Strongly NP-complete

• abstract: In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. A general computational problem may have numerical parameters.

以上来源于: WordNet