Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03507496n
Noun Named Entity
EL
No term available
EN
In complexity theory, PP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of less than 1/2 for all instances. Wikipedia
English:
complexity
class
complexity class
Relations
Sources
IS A
κλάση πολυπλοκότητας
υπολογιστικό πρόβλημα
HAS PART
EN
AWPP
EN
QMA
PART OF
EN
PSPACE
SAID TO BE THE SAME AS
EN
PostBQP

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