Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346292n
Noun Named Entity
EL
No term available
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
Relations
Sources
IS A
κλάση πολυπλοκότητας
PART OF
p

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