Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03511773n
Noun Named Entity
EL
FP
EN
In computational complexity theory, the complexity class FP is the set of function problems that can be solved by a deterministic Turing machine in polynomial time. Wikipedia
English:
class
complexity class
complexity
Relations
Sources
IS A
κλάση πολυπλοκότητας
HAS PART
EN
FL
PART OF
EN
PLS
BabelNet
EL
FP

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