Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7292008> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- Q7292008 subject Q7452210.
- Q7292008 subject Q8681013.
- Q7292008 abstract "Randomized algorithms are algorithms that employ a degree of randomness as part of their logic. These algorithms can be used to give good average-case results (complexity-wise) to problems which are hard to solve deterministically, or display poor worst-case complexity. An algorithmic game theoretic approach can help explain why in the average case randomized algorithms may work better than deterministic algorithms.".
- Q7292008 wikiPageWikiLink Q1064349.
- Q7292008 wikiPageWikiLink Q1546627.
- Q7292008 wikiPageWikiLink Q156612.
- Q7292008 wikiPageWikiLink Q17455.
- Q7292008 wikiPageWikiLink Q186094.
- Q7292008 wikiPageWikiLink Q200125.
- Q7292008 wikiPageWikiLink Q200726.
- Q7292008 wikiPageWikiLink Q333464.
- Q7292008 wikiPageWikiLink Q44455.
- Q7292008 wikiPageWikiLink Q4828244.
- Q7292008 wikiPageWikiLink Q486598.
- Q7292008 wikiPageWikiLink Q583461.
- Q7292008 wikiPageWikiLink Q7452210.
- Q7292008 wikiPageWikiLink Q751319.
- Q7292008 wikiPageWikiLink Q8049023.
- Q7292008 wikiPageWikiLink Q8681013.
- Q7292008 comment "Randomized algorithms are algorithms that employ a degree of randomness as part of their logic. These algorithms can be used to give good average-case results (complexity-wise) to problems which are hard to solve deterministically, or display poor worst-case complexity. An algorithmic game theoretic approach can help explain why in the average case randomized algorithms may work better than deterministic algorithms.".
- Q7292008 label "Randomized algorithms as zero-sum games".