Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03138635n
Noun Named Entity
Categories: Probabilistic complexity classes
EN
BPP  Bounded-error probabilistic polynomial  Bounded error probability in polynomial time  P = BPP problem
EN
In computational complexity theory, a branch of computer science, bounded-error probabilistic polynomial time is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability bounded by 1/3 for all instances. Wikipedia
English:
complexity
complexity class
Definitions
Relations
Sources
EN
In computational complexity theory, a branch of computer science, bounded-error probabilistic polynomial time is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability bounded by 1/3 for all instances. Wikipedia
Complexity class Wikidata
IS A
complexity class
computational problem
HAS PART
Randomized polynomial time
PART OF
P/poly
BQP
Wikipedia
EN
BPP (complexity)
Wikidata
EN
BPP
Wikipedia Redirections
EN
Bounded-error probabilistic polynomial, Bounded error probability in polynomial time, BPP (complexity class), P = BPP problem

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