Title of article :
More on BPP and the Polynomial-time Hierarchy
Author/Authors :
Ran Canetti، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1996
Keywords :
computational complexity , Interactive proofs , Theory of computation , randomness
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
