Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03347312n
Noun Named Entity
Categories: All articles needing additional references, Articles with short description, Probabilistic complexity classes
EN
Randomized polynomial time  RP  co-RP  Randomized polynomial-time
EN
In computational complexity theory, randomized polynomial time is the complexity class of problems for which a probabilistic Turing machine exists with these properties: It always runs in polynomial time in the input size If the correct answer is NO, it always returns NO If the correct answer is YES, then it returns YES with probability at least 1/2. Wikipedia
English:
complexity
class
complexity class
Definitions
Relations
Sources
EN
In computational complexity theory, randomized polynomial time is the complexity class of problems for which a probabilistic Turing machine exists with these properties: It always runs in polynomial time in the input size If the correct answer is NO, it always returns NO If the correct answer is YES, then it returns YES with probability at least 1/2. Wikipedia
Randomized polynomial time, a class in computational complexity theory Wikipedia Disambiguation
Complexity class Wikidata
IS A
complexity class
HAS PART
ZPP
P
PART OF
BPP
Wikipedia
EN
RP (complexity)
Wikidata
EN
Randomized polynomial time (RP)
Wikipedia Redirections
EN
co-RP, Randomized polynomial-time, randomized polynomial time, RP (class)

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