Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Pseudorandom generators for polynomials
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of… Expand
2016
2016
Non-malleable codes (NMCs) protect sensitive data against degrees of corruption that prohibit error detection, ensuring instead… Expand
2014
2014
This thesis explores the relationship between evolutionary theory and the weird tale in the late nineteenth and early twentieth… Expand
2009
2009
Recently Bogdanov and Viola (FOCS 2007) and Lovett (ECCC-07) constructed pseudorandom generators that fool degree k polynomials… Expand
2009
2009
Government and sport organisations have spent considerable resources on increasing the number of female coaches in sport, yet… Expand
2008
2008
Dioecious plant populations have generally been considered to maintain sex ratios of 1:1 (Allen & Antos 1993, Carroll & Mulcahy… Expand
Highly Cited
2007
Highly Cited
2007
We prove that the sum of d small-bias generators L : Fs rarr Fn fools degree-d polynomials in n variables over a prime field F… Expand
2006
2006
The geographical visualization of urban and regional landscapes is a powerful technique for engaging actors involved in decision… Expand
Review
2005
Review
2005
In this study we compared the use of two supplemental balanced and strategic reading interventions that targeted the decoding… Expand
2003
2003
This article explores three broad themes about transitions that have emerged in a naturalistic study of experiences of families… Expand