Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346292n
Noun Named Entity
Categories: Complexity classes
EN
P-complete  circuit value problem  P complete  PTIME-complete  PTIME-hard
EN
In computational complexity theory, a decision problem is P-complete if it is in P and every problem in P can be reduced to it by an appropriate reduction. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, a decision problem is P-complete if it is in P and every problem in P can be reduced to it by an appropriate reduction. Wikipedia
Complexity class of decision problems in P such that every problem in P can be reduced to it by an appropriate reduction Wikidata
IS A
complexity class
PART OF
P
Wikipedia
EN
P-complete
Wikidata
EN
P-complete
Wikipedia Redirections
EN
circuit value problem, P-Complete, P complete, PTIME-complete, PTIME-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