Skip to search formSkip to main contentSkip to account menu

Pseudorandom generators for polynomials

In theoretical computer science, a pseudorandom generator for low-degree polynomials is an efficient procedure that maps a short truly random seed to… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Non-malleable codes (NMCs) protect sensitive data against degrees of corruption that prohibit error detection, ensuring instead… 
Highly Cited
2014
Highly Cited
2014
  • T. Rothvoss
  • IEEE Annual Symposium on Foundations of Computer…
  • 2014
  • Corpus ID: 15414320
A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(√(n… 
2008
2008
Dioecious plant populations have generally been considered to maintain sex ratios of 1:1 (Allen & Antos 1993, Carroll & Mulcahy… 
2006
2006
The geographical visualization of urban and regional landscapes is a powerful technique for engaging actors involved in decision… 
Review
2005
Review
2005
In this study we compared the use of two supplemental balanced and strategic reading interventions that targeted the decoding… 
2003
2003
This article explores three broad themes about transitions that have emerged in a naturalistic study of experiences of families… 
2002
2002
AIM: To determine the impact of prognostic factors on survival of patients with metastases from colorectal cancer that underwent… 
1978
1978
A number of bacilli have been reported to contain plasmids, e.g. Bacillus megaterium (Carlton, 1976), B. pumilus (Lovett…