<p>Regarding each of the above classes, what are the currently known upper bounds when the verifier is given more than polynomial power?</p>
<p>Specifically, when do we reach ALL in each of the above classes with respect to (as a function of) the power of the verifier?</p>

CC BY-SA 4.0
2021-03-09T09:11:36.963Z
If we allowed sending superpolynomial bits, the extension of IP will be superpolynomial space and the extension of MIP will be $NPTIME(2^{superpoly(n)})$.
Mohsen Ghorbani
CC BY-SA 4.0
2021-03-09T10:56:52.370Z
@MohsenGhorbani - You mean NTIME(2^{superpoly(n)}) right?
Avi Tal
CC BY-SA 4.0
2021-03-09T11:00:54.270Z
Of course, it was my mistake.
Mohsen Ghorbani
<complexity-classes><interactive-proofs>
IP, MIP and MIP* with super-polynomial verifier
Avi Tal
# IP, MIP and MIP* with super-polynomial verifier

(Asked by: username_0 on 2021-03-09)

Regarding each of the above classes, what are the currently known upper bounds when the verifier is given more than polynomial power?

Specifically, when do we reach ALL in each of the above classes with respect to (as a function of) the power of the verifier?

**Tags:** complexity-classes, interactive-proofs

> **Comments:**
> **username_1**: If we allowed sending superpolynomial bits, the extension of IP will be superpolynomial space and the extension of MIP will be $NPTIME(2^{superpoly(n)})$.  
> **username_0**: @MohsenGhorbani - You mean NTIME(2^{superpoly(n)}) right?  
> **username_1**: Of course, it was my mistake.  

---

## 0 answers

