Title of article

More on BPP and the Polynomial-time Hierarchy

Author/Authors

Ran Canetti، نويسنده ,

Issue Information

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

Pages

5

From page

237

To page

241

Keywords

computational complexity , Interactive proofs , Theory of computation , randomness

Journal title

Information Processing Letters

Serial Year

1996

Journal title

Information Processing Letters

Record number