Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02474583n
Noun Named Entity
Categories: Complexity classes
EN
UP  unambiguous non-deterministic polynomial-time
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
Definitions
Relations
Sources
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
Complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input Wikidata
IS A
complexity class
HAS PART
P
PART OF
NP
Wikipedia
EN
UP (complexity)
Wikidata
EN
UP
Wikidata Alias
EN
unambiguous non-deterministic polynomial-time

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