Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Yao's_principle> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- Yao's_principle abstract "In computational complexity theory, Yao's principle or Yao's minimax principle states that the expected cost of a randomized algorithm on the worst case input, is no better than a worst-case random probability distribution of the deterministic algorithm which performs best for that distribution. Thus, to establish a lower bound on the performance of randomized algorithms, it suffices to find an appropriate distribution of difficult inputs, and to prove that no deterministic algorithm can perform well against that distribution. This principle is named after Andrew Yao, who first proposed it.Yao's principle may be interpreted in game theoretic terms, via a two-player zero sum game in which one player, Alice, selects a deterministic algorithm, the other player, Bob, selects an input, and the payoff is the cost of the selected algorithm on the selected input. Any randomized algorithm R may be interpreted as a randomized choice among deterministic algorithms, and thus as a strategy for Alice. By von Neumann's minimax theorem, Bob has a randomized strategy that performs at least as well against R as it does against the best pure strategy Alice might choose; that is, Bob's strategy defines a distribution on the inputs such that the expected cost of R on that distribution (and therefore also the worst case expected cost of R) is no better than the expected cost of any single deterministic algorithm against the same distribution.".
- Yao's_principle wikiPageExternalLink favorite-theorems-yao-principle.html.
- Yao's_principle wikiPageID "4835703".
- Yao's_principle wikiPageRevisionID "568022187".
- Yao's_principle hasPhotoCollection Yao's_principle.
- Yao's_principle subject Category:Computational_complexity_theory.
- Yao's_principle subject Category:Randomness.
- Yao's_principle comment "In computational complexity theory, Yao's principle or Yao's minimax principle states that the expected cost of a randomized algorithm on the worst case input, is no better than a worst-case random probability distribution of the deterministic algorithm which performs best for that distribution.".
- Yao's_principle label "Yao's principle".
- Yao's_principle sameAs m.0cq70h.
- Yao's_principle sameAs Q8049023.
- Yao's_principle sameAs Q8049023.
- Yao's_principle wasDerivedFrom Yao's_principle?oldid=568022187.
- Yao's_principle isPrimaryTopicOf Yao's_principle.