Technical Reports
A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
|
TR-260-90
The Polynomial Hierarchy is Provable by Two Provers in One Round |
|
| Authors: | Cai, Jin-Yi |
| Date: | December 1989 |
| Pages: | 4 |
| Download Formats: | |
We consider multiprover interactive proof systems. We show that the polynomial hierarchy is provable by two provers in one round. |
|
