Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00311120n
Noun Concept
NL
No term available
EN
In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" problems in the complexity class. Wikipedia
English:
complexity
Relations
Sources
IS A
complexiteitsgraad
FACET OF
computationele complexiteitstheorie

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