Advanced
Theory of Computation
Q90 / 100
What is the Razborov-Smolensky theorem?
Correct! Well done.
Incorrect.
The correct answer is B) Proving super-polynomial lower bounds on the size of constant-depth AC⁰[p] circuits computing MOD-q for prime p ≠ q
B
Correct Answer
Proving super-polynomial lower bounds on the size of constant-depth AC⁰[p] circuits computing MOD-q for prime p ≠ q
Explanation
Razborov showed MOD-2 is not in AC⁰[3]; Smolensky extended this to all primes. This is one of the deepest circuit lower bounds, proving strict separations in the circuit complexity hierarchy.
Progress
90/100