Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03507496n
Noun Named Entity
Categories: Probabilistic complexity classes, Quantum complexity theory
EN
PP  probabilistic polynomial-time  probabilistic polynomial time  Majority-P  PQP
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
complexity class
class
Definitions
Relations
Sources
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
A probabilistic polynomial time complexity class Wikipedia Disambiguation
Complexity class Wikidata
IS A
complexity class
computational problem
HAS PART
AWPP
QMA
PART OF
PSPACE
SAID TO BE THE SAME AS
PostBQP
Wikipedia
EN
PP (complexity)
Wikidata
EN
PP
Wikipedia Redirections
EN
PP (class), PQP, probabilistic polynomial-time, probabilistic polynomial time
Wikidata Alias
EN
Majority-P

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