Dragonfall
- 1,023
- 5
You can prove that [tex]\mathbf{IP} \subset \mathbf{PSPACE}[/tex] by traversing the exponentially large decision tree of the prover, which takes only polynomial amount of space at a time.
Why can't you do the same in the case of multiple provers? You'd traverse polynomially many trees at a time instead of one, but that should only require poly space. Instead, [tex]\mathbf{MIP} \subset \mathbf{NEXP}[/tex].
Why can't you do the same in the case of multiple provers? You'd traverse polynomially many trees at a time instead of one, but that should only require poly space. Instead, [tex]\mathbf{MIP} \subset \mathbf{NEXP}[/tex].