Matches in DBpedia 2014 for { <http://dbpedia.org/resource/RP_(complexity)> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- RP_(complexity) abstract "Randomized polynomial time (RP) is the complexity class of computational complexity theory, 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 (otherwise, it returns NO).In other words, the algorithm is allowed to flip a truly random coin while it is running. The only case in which the algorithm can return YES is if the actual answer is YES; therefore if the algorithm terminates and produces YES, then the correct answer is definitely YES; however, the algorithm can terminate with NO regardless of the actual answer. That is, if the algorithm returns NO, it might be wrong. Some authors call this class R, although this name is more commonly used for the class of recursive languages.If the correct answer is YES and the algorithm is run n times with the result of each run statistically independent of the others, then it will return YES at least once with probability at least 1 − 2−n. So if the algorithm is run 100 times, then the chance of it giving the wrong answer every time is lower than the chance that cosmic rays corrupted the memory of the computer running the algorithm.[citation needed] In this sense, if a source of random numbers is available, most algorithms in RP are highly practical.The fraction 1/2 in the definition is arbitrary. The set RP will contain exactly the same problems, even if the 1/2 is replaced by any constant nonzero probability less than 1; here constant means independent of the input to the algorithm.".
- RP_(complexity) wikiPageExternalLink rp.
- RP_(complexity) wikiPageID "54771".
- RP_(complexity) wikiPageRevisionID "606089701".
- RP_(complexity) hasPhotoCollection RP_(complexity).
- RP_(complexity) subject Category:Probabilistic_complexity_classes.
- RP_(complexity) type Abstraction100002137.
- RP_(complexity) type Class107997703.
- RP_(complexity) type Collection107951464.
- RP_(complexity) type Group100031264.
- RP_(complexity) type ProbabilisticComplexityClasses.
- RP_(complexity) comment "Randomized polynomial time (RP) is the complexity class of computational complexity theory, 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 (otherwise, it returns NO).In other words, the algorithm is allowed to flip a truly random coin while it is running.".
- RP_(complexity) label "RP (Komplexitätsklasse)".
- RP_(complexity) label "RP (complessità)".
- RP_(complexity) label "RP (complexity)".
- RP_(complexity) label "RP (complexité)".
- RP_(complexity) label "RP (複雜度)".
- RP_(complexity) label "RP (計算複雑性理論)".
- RP_(complexity) label "Класс RP".
- RP_(complexity) label "أر بي (تعقيد حسابي)".
- RP_(complexity) sameAs RP_(třída_složitosti).
- RP_(complexity) sameAs RP_(Komplexitätsklasse).
- RP_(complexity) sameAs RP_(complexité).
- RP_(complexity) sameAs RP_(complessità).
- RP_(complexity) sameAs RP_(計算複雑性理論).
- RP_(complexity) sameAs RP_(복잡도).
- RP_(complexity) sameAs m.0f8s3.
- RP_(complexity) sameAs Q1190846.
- RP_(complexity) sameAs Q1190846.
- RP_(complexity) sameAs RP_(complexity).
- RP_(complexity) wasDerivedFrom RP_(complexity)?oldid=606089701.
- RP_(complexity) isPrimaryTopicOf RP_(complexity).