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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An elevated level of the free deaminated sialic acid, 2-keto-3-deoxy-D-glycero-D-galacto-nononic acid (KDN), was first discovered… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2013
2013
The garbled circuit technique transforms a circuit in such a way that it can be evaluated on encrypted inputs. Garbled circuits… (More)
  • figure 1
Is this relevant?
2013
2013
Resumen en: Retinol binding protein 4 (RBP4), has recently been identified as novel adipokines associated with obesity, type 2… (More)
  • table 1
  • table 2
Is this relevant?
2012
2012
Xiāo Yao Sǎn is extensively used in clinic,involving internal department,surgical department,pediatric department,gynecological… (More)
Is this relevant?
2006
2006
Evolutionary algorithms (EA) have been shown to be very effective in solving practical problems, yet many important theoretical… (More)
Is this relevant?
2003
2003
Abilities are as important as interests in career choice and development. Reviving cognitive assessment in career counseling… (More)
Is this relevant?
2000
2000
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… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1987
1987
In this paper we consider a synchronous broadcasting network, a. distributed computation model which represents communication… (More)
Is this relevant?
1986
1986
We present a modification to the divide-and-conquer algorithm of Guibas & Stolfi [GS] for computing the Delaunay triangulation of… (More)
  • figure 1.1
  • figure 3.1
  • figure 4.1
  • figure 4.2
  • figure 5.1
Is this relevant?
1984
1984
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… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?