FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2002-2018
024620022018

Related topics

Related topics

4 relations
Pseudorandom generatorSmall-bias sample spaceTheoretical computer science

Broader (1)

Pseudorandomness

Related mentions per year

Related mentions per year

1942-2018
19401960198020002020
Pseudorandom generators for polynomials
Pseudorandomness
Theoretical computer science
Pseudorandom generator
Small-bias sample space

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
LOVETT scalling with MYO armband for monitoring finger muscles therapy of post-stroke people
LOVETT scale is a parameter that commonly used by the doctor or therapist to determine the muscle strength of the patient's hands… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2016
2016
Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes
Non-malleable codes (NMCs) protect sensitive data against degrees of corruption that prohibit error detection, ensuring instead… (More)
Is this relevant?
2016
2016
REVISITING THE SANDERS-FREIMAN-RUZSA THEOREM IN Fp AND ITS APPLICATION TO NON-MALLEABLE CODES
Non-malleable codes (NMCs) protect sensitive data against degrees of corruption that prohibit error detection, ensuring instead… (More)
Is this relevant?
2015
2015
Evaluation of the Double-Deficit Hypotheses in College Students Referred for Learning Difficulties
The present study explored the double-deficit hypothesis (DDH) in a sample of 146 college students with and without reading… (More)
  • table 5
  • table 6
Is this relevant?
2014
2014
Constructive Discrepancy Minimization for Convex Sets
A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(√(n… (More)
  • figure 1
Is this relevant?
2011
2011
Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
Hardness amplification results show that for every Boolean function f, there exists a Boolean function Amp(f) such that if every… (More)
Is this relevant?
2008
2008
Sex ratio , size distribution and nitrogen resorption in the dioecious tree species Bursera morelensis ( Burseraceae )
Dioecious plant populations have generally been considered to maintain sex ratios of 1:1 (Allen & Antos 1993, Carroll & Mulcahy… (More)
  • figure 1
Is this relevant?
Review
2008
Review
2008
Short-term decay of production values for cognitive control
A model of prospective time-estimation is introduced which explains the interplay of working memory demands on duration… (More)
Is this relevant?
2006
2006
Representation and Uncertainty 1 Complex visual data analysis , uncertainty , and representation
How do problem solvers represent visual-spatial information in complex problem solving tasks? This paper explores the predictions… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
Running head : Strategy Variability Strategy Variability : How Too Much of a Good Thing can Hurt Performance
Recent research (e.g., Siegler, 1996) has discovered the important and vital role that variability plays among strategy use and… (More)
  • table 1
  • table 2
Is this relevant?