مرکز منطقه ای اطلاع رساني علوم و فناوري

DocumentCode :

3152012

Title :

On the power of PP

Author :

Vereschchagin, N.K.

Author_Institution :

Inst. of New Technol., Moscow

fYear :

1992

fDate :

22-25 Jun 1992

Firstpage :

138

Lastpage :

143

Abstract :

It is proved that MA is a subset of PP (relativizable) and that the intersection of AM^A and co-AM^A is not a subset of PP^A for some oracle A

Keywords :

computational complexity; MA; PP; oracle; Distributed computing; Nominations and elections; Polynomials; Turing machines;

fLanguage :

English

Publisher :

ieee

Conference_Titel :

Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual

Conference_Location :

Boston, MA

Print_ISBN :

0-8186-2955-X

Type :

conf

DOI :

10.1109/SCT.1992.215389

Filename :

215389

Link To Document :