In Yao's paper proving Yao's principle, he equates the lower bound of a randomized Las Vegas algorithm with the expected run time of the best deterministic algorithm on the worst input. He goes on to generalize this to Monte Carlo algorithms with error, in particular in Theorem 3:

enter image description here

However I do not understand how this result follows from the original principle. Could someone please explain/shed some color?


Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.