Triple
T15244895
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | MIP = NEXP |
E364352
|
entity |
| Predicate | isCitedAs |
P771
|
FINISHED |
| Object |
Babai–Fortnow–Lund–Safra–Szegedy theorem
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.
|
E1145567
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d85a0dde7481908fc64d1e82d5d20d |
elicitation | completed |
| NER | batch_69e007f306f08190be448b215d6c9b6c |
ner | completed |
| NED1 | batch_69fedd461cf08190a506aac2f0cec83a |
ned_source_triple | completed |
| NED2 | batch_69fee0016a088190ad87268e035f677e |
ned_description | completed |
| NEDg | batch_69fedf6ee3f081909553078cd3e9d243 |
nedg | completed |
Created at: April 10, 2026, 3:13 a.m.