Babai–Fortnow–Lund–Safra–Szegedy theorem

E1145567 UNEXPLORED

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.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Babai–Fortnow–Lund–Safra–Szegedy theorem canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

MIP equals NEXP → isCitedAs → Babai–Fortnow–Lund–Safra–Szegedy theorem ⓘ

subject surface form: MIP = NEXP