مرکز منطقه ای اطلاع رساني علوم و فناوري - On the complexity of interactive proofs with bounded communication

Title of article :

On the complexity of interactive proofs with bounded communication

Author/Authors :

Oded Goldreich، نويسنده , , Johan H?stad، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1998

Pages :

From page :

205

To page :

214

Keywords :

Computational complexicity , Theory of computation

Journal title :

Information Processing Letters

Serial Year :

1998

Journal title :

Information Processing Letters

Record number :

128940

Link To Document :