# Interactive proof and PSPACE

1. Oct 23, 2012

### Dragonfall

You can prove that $$\mathbf{IP} \subset \mathbf{PSPACE}$$ 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, $$\mathbf{MIP} \subset \mathbf{NEXP}$$.

2. Oct 23, 2012

### Dragonfall

I'd have posted this in the CS subforums, but this is more of a theoretical question.