Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03511773n
Noun Named Entity
Categories: Complexity classes
EN
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
Definitions
Relations
Sources
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
Complexity class Wikidata
IS A
complexity class
HAS PART
FL
PART OF
PLS
Wikipedia
EN
FP (complexity)
Wikidata
EN
FP
Wikipedia Redirections
EN
FP (class)

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