Title of article
Relativized collapsing between BPP and PH under stringent oracle access
Author/Authors
Jin-Yi Cai، نويسنده , , Osamu Watanabe، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
8
From page
147
To page
154
Keywords
computational complexity , Stringent relativization , Decision tree complexity , Switching lemma , Boundederror probabilistic polynomial time , polynomial hierarchy
Journal title
Information Processing Letters
Serial Year
2004
Journal title
Information Processing Letters
Record number
129894
Link To Document