Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00311120n
Noun Concept
Categories: Articles with short description, Computational complexity theory
EN
complete  -complete  -hard  C-complete  C-hard
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
Definitions
Relations
Sources
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
A notion referring to a problem in computational complexity theory that all other problems in a class reduce to Wikipedia Disambiguation
Notion of the "hardest" or "most general" problem in a complexity class Wikidata
IS A
complexity class
FACET OF
computational complexity theory
Wikipedia
EN
complete (complexity)
Wikidata
EN
complete
Wikipedia Redirections
EN
complete problem, hard (complexity)
Wikidata Alias
EN
-complete, -hard, C-complete, C-hard, completeness, hard, hardness

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