Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL

Keyphrases

• Derandomization 100%
• DSPACE 100%
• Non-black-box 50%
• Cryptographic Assumptions 50%
• Deterministic Algorithm 50%
• Bounded Space 50%
• Minimal Memory 50%
• Hardness Assumptions 50%
• Log-space 50%
• Space-bounded Computation 50%
• Memory Footprint 50%
• Space-bounded Turing Machines 50%

Mathematics

• Derandomization 100%
• Main Result 50%
• Black Box 50%
• Turing Machine 50%

Computer Science

• Memory Footprint 100%
• Turing Machine 100%