Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7255476> ?p ?o }
Showing triples 1 to 14 of
14
with 100 triples per page.
- Q7255476 subject Q7014402.
- Q7255476 abstract "In theoretical computer science, a pseudorandom generator for low-degree polynomials is an efficient procedure that maps a short truly random seed to a longer pseudorandom string in such a way that low-degree polynomials cannot distinguish the output distribution of the generator from the truly random distribution. That is, evaluating any low-degree polynomial at a point determined by the pseudorandom string is statistically close to evaluating the same polynomial at a point that is chosen uniformly at random.Pseudorandom generators for low-degree polynomials are a particular instance of pseudorandom generators for statistical tests, where the statistical tests considered are evaluations of low-degree polynomials.".
- Q7255476 wikiPageExternalLink bias_abs.html.
- Q7255476 wikiPageExternalLink download.
- Q7255476 wikiPageExternalLink d.pdf.
- Q7255476 wikiPageExternalLink v005a003.pdf.
- Q7255476 wikiPageWikiLink Q1936288.
- Q7255476 wikiPageWikiLink Q2878974.
- Q7255476 wikiPageWikiLink Q603880.
- Q7255476 wikiPageWikiLink Q7014402.
- Q7255476 wikiPageWikiLink Q7255474.
- Q7255476 wikiPageWikiLink Q7542591.
- Q7255476 comment "In theoretical computer science, a pseudorandom generator for low-degree polynomials is an efficient procedure that maps a short truly random seed to a longer pseudorandom string in such a way that low-degree polynomials cannot distinguish the output distribution of the generator from the truly random distribution.".
- Q7255476 label "Pseudorandom generators for polynomials".