Advanced
Theory of Computation
Q96 / 100
What is derandomization and its connection to circuit lower bounds?
Correct! Well done.
Incorrect.
The correct answer is B) Removing randomness from probabilistic algorithms; Nisan-Wigderson showed hard functions imply pseudorandom generators, connecting lower bounds to P = BPP
B
Correct Answer
Removing randomness from probabilistic algorithms; Nisan-Wigderson showed hard functions imply pseudorandom generators, connecting lower bounds to P = BPP
Explanation
Nisan-Wigderson (1994): if there exist functions hard for exponential-size circuits, then P = BPP (all randomized polynomial algorithms can be derandomized). Strong lower bounds → BPP = P.
Progress
96/100