AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |
Back to Blog
That is, if the algorithm returns NO, it might be wrong. ![]() 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. In other words, the algorithm is allowed to flip a truly random coin while it is running. ⁕If the correct answer is YES, then it returns YES with probability at least 1/2. ⁕If the correct answer is NO, it always returns NO ⁕It always runs in polynomial time in the input size RP Randomized polynomial time is the complexity class of computational complexity theory, problems for which a probabilistic Turing machine exists with these properties:
0 Comments
Read More
Leave a Reply. |