The Polynomial Hierarchy is Provable by Two Provers in One Round

Report ID: TR-260-90

---

Author: Cai, Jin-Yi

---

Date: 1989-12-00

---

Pages: 5

---

Download Formats: |PDF|

---

Abstract:

We consider multiprover interactive proof systems. We show that the polynomial hierarchy is provable by two provers in one round.