Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03258069n
Noun Concept
IT
No term available
EN
In computational complexity theory, Yao's principle is a way to prove lower bounds on the worst-case performance of randomized algorithms, by comparing them to deterministic algorithms. Wikipedia
Relations
Sources
IS A
principio
NAMED AFTER
Andrew Chi-Chih Yao

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