Skip to search formSkip to main contentSkip to account menu

Yao's principle

Known as: Yao Principle, Yao's minimax principle 
In computational complexity theory, Yao's principle or Yao's minimax principle states that the expected cost of a randomized algorithm on the worst… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Alice and BobComputational complexity theoryDeterministic algorithmGame theory

Broader (1)

Randomness

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Physical Cryptography
. We recall a series of physical cryptography solutions and provide the reader with relevant security analyses. We mostly turn… 
2015
2015
Fairness in Secure Two-Party Computation with Rational Players
A seminal result of Cleve (STOC 1986) showed that fairness, in general, is impossible to achieve in case of two-party computation… 
2012
2012
Mechanism of Xiāo-Yáo-Sǎn in Treating Various Diseases and Patterns
Xiāo Yao Sǎn is extensively used in clinic,involving internal department,surgical department,pediatric department,gynecological… 
2011
2011
On the Image of Contemporary Youth Described by Lu Yao
Lu Yao is one of the few contemporary Chinese writers who wrote for all the people,he created a number of vivid characters in a… 
2011
2011
YAO Meizhen and His International Law Theory
2010
2010
Principles of reusability of XML-based enterprise documents.
MALO, R.: Principles of reusability of XML-based enterprise documents. Acta univ. agric. et silvic. Mendel. Brun., 2010, LVIII… 
2007
2007
Research Statement Summary of Accomplished Research
My research interests have been in the field of classical and quantum information theory. During my research till now, I have… 
2006
2006
On Yao Yongpu's METHODS OF HISTORICAL STUDIES
THE METHODS OF HISTORICAL STUDIES is a monograph of Yao Yongpu, scholar of the late period of the Tongcheng School, which… 
2000
2000
Fast Expected-Tinie and Approximation Algorithms for Geometric Minimum Spanning Trees
Kenneth L. Clarkson Stanford University §1 I n t r o d u c t i o n We present algorithms for solving the geometric minimum… 
1999
1999
Tolerating Faults in Counting
Counting networks were proposed by Aspnes, Herlihy and Shavit 4] as a technique for solving multiprocessor coordination problems… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)