Undirected connectivity in log-space

Target entity: Undirected connectivity in log-space
Context triple: [Omer Reingold, notableWork, Undirected connectivity in log-space]

• A. Furst–Saxe–Sipser lower bounds
  Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
• B. Håstad’s switching lemma
  Håstad’s switching lemma is a fundamental result in computational complexity theory that provides powerful bounds on the simplification of Boolean formulas under random restrictions, with major applications in circuit lower bounds.
• C. Lipton–Tarjan separator theorem
  The Lipton–Tarjan separator theorem is a fundamental result in graph theory that shows any planar graph can be efficiently divided into roughly equal parts by removing only a relatively small set of vertices, enabling faster algorithms for many computational problems.
• D. MIP equals NEXP
  MIP equals NEXP is a landmark complexity-theoretic result showing that problems solvable by multi-prover interactive proofs exactly match those solvable in nondeterministic exponential time.
• E. Valiant–Vazirani theorem
  The Valiant–Vazirani theorem is a fundamental result in computational complexity theory showing that solving unique solutions of NP problems is, under randomized reductions, as hard as solving general NP problems, with major implications for the study of randomness and hardness of approximation.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Undirected connectivity in log-space
Target entity description: "Undirected connectivity in log-space" is a landmark theoretical computer science paper by Omer Reingold that proved the complexity classes L and SL are equal by giving a deterministic log-space algorithm for undirected graph connectivity.

• A. Furst–Saxe–Sipser lower bounds
  Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
• B. Håstad’s switching lemma
  Håstad’s switching lemma is a fundamental result in computational complexity theory that provides powerful bounds on the simplification of Boolean formulas under random restrictions, with major applications in circuit lower bounds.
• C. Lipton–Tarjan separator theorem
  The Lipton–Tarjan separator theorem is a fundamental result in graph theory that shows any planar graph can be efficiently divided into roughly equal parts by removing only a relatively small set of vertices, enabling faster algorithms for many computational problems.
• D. MIP equals NEXP
  MIP equals NEXP is a landmark complexity-theoretic result showing that problems solvable by multi-prover interactive proofs exactly match those solvable in nondeterministic exponential time.
• E. Valiant–Vazirani theorem
  The Valiant–Vazirani theorem is a fundamental result in computational complexity theory showing that solving unique solutions of NP problems is, under randomized reductions, as hard as solving general NP problems, with major implications for the study of randomness and hardness of approximation.
• F. None of above. chosen