On the Complexity of
Interactive Pro ofs with Bounded Communication
Johan H astad Oded Goldreich
Department of Computer Science Department of Computer Science
Weizmann Institute of Science Royal Institute of Technology
Rehovot Israel Sto ckholm Sweden
oded wisdom weizmann ac