bn:03475047n
Noun Named Entity
AR
No term available
EN
In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. Wikipedia
Relations
Sources