Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02474583n
Noun Named Entity
EL
No term available
EN
In complexity theory, UP is the complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input. Wikipedia
English:
complexity
Relations
Sources
IS A
κλάση πολυπλοκότητας
HAS PART
p
PART OF
NP

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