Pseudorandom generators with optimal seed length for non-boolean poly-size circuits

Keyphrases

• Computable 100%
• Pseudorandom number Generator 100%
• Seed Length 100%
• Optimal Seeds 100%
• Non-Boolean 100%
• Sampling Methods 66%
• Pseudorandomness 33%
• Incompressibility 33%
• Derandomization 33%
• Uniform Distribution 33%
• Random Inputs 33%
• Large-scale Event 33%
• G(0) 33%
• Probability Distribution 33%
• Nondeterministic Circuits 33%
• Constant-depth Circuits 33%
• Statistical Distance 33%
• Nonstandard Assumptions 33%
• Shannon Entropy 33%
• Cryptographic Assumptions 33%
• Uniform Families 33%

Mathematics

• Sampling Procedure 100%
• Conditionals 50%
• Incompressibility 50%
• Uniform Distribution 50%
• Random Input 50%
• Nonuniform 50%
• Derandomization 50%
• Probability Distribution 50%
• Shannon Entropy 50%