Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03475047n
Noun Named Entity
Categories: Strongly NP-complete problems, Complexity classes, Computational complexity theory
EN
strong NP-completeness  strongly NP-complete  strongly NP-hard
EN
In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness. Wikipedia
Property of computational problems that is a special case of NP-completeness Wikidata
IS A
complexity class
PART OF
NP-complete
Wikipedia
EN
strong NP-completeness
Wikidata
EN
strong NP-completeness
Wikipedia Redirections
EN
strongly NP-complete, strongly NP-hard

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License