Babai–Fortnow–Lund–Safra–Szegedy theorem

Target entity: Babai–Fortnow–Lund–Safra–Szegedy theorem
Context triple: [MIP = NEXP, isCitedAs, Babai–Fortnow–Lund–Safra–Szegedy theorem]

• A. 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.
• B. 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.
• C. 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.
• D. Interactive Proofs and the Hardness of Approximating Cliques
  "Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
• E. The Knowledge Complexity of Interactive Proof Systems
  "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Babai–Fortnow–Lund–Safra–Szegedy theorem
Target entity description: The Babai–Fortnow–Lund–Safra–Szegedy theorem is a landmark result in computational complexity theory that characterizes the power of multi-prover interactive proofs by showing they capture exactly the class of nondeterministic exponential-time problems.

• A. 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.
• B. 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.
• C. 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.
• D. Interactive Proofs and the Hardness of Approximating Cliques
  "Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
• E. The Knowledge Complexity of Interactive Proof Systems
  "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
• F. None of above. chosen