Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy

1990 ◽  
Vol 37 (2) ◽  
pp. 415-438 ◽  
Author(s):  
Ker-I Ko
Keyword(s):  
Polynomial Time ◽  
Probabilistic Polynomial Time ◽  
Polynomial Time Hierarchy

The polynomial-time hierarchy and sparse oracles

1986 ◽  
Vol 33 (3) ◽  
pp. 603-617 ◽  
Author(s):  
Jose L. Balcázar ◽  
Ronald V. Book ◽  
Uwe Schöning
Keyword(s):  
Polynomial Time ◽  
Polynomial Time Hierarchy

Probabilistic Polynomial-Time Semantics for a Protocol Security Logic

2005 ◽  
pp. 16-29 ◽  
Author(s):  
Anupam Datta ◽  
Ante Derek ◽  
John C. Mitchell ◽  
Vitaly Shmatikov ◽  
Mathieu Turuani
Keyword(s):  
Polynomial Time ◽  
Protocol Security ◽  
Time Semantics ◽  
Probabilistic Polynomial Time

ON HIGHER ARTHUR-MERLIN CLASSES

2004 ◽  
Vol 15 (01) ◽  
pp. 3-19
Author(s):  
JIN-YI CAI ◽  
DENIS CHARLES ◽  
A. PAVAN ◽  
SAMIK SENGUPTA
Keyword(s):  
Polynomial Time ◽  
Upper Bounds ◽  
Complexity Classes ◽  
Polynomial Time Hierarchy

We study higher Arthur-Merlin classes defined via several natural probabilistic operators BP, R and coR. We investigate the complexity classes they define, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bounds to the intersection of the complementary classes in the hierarchy.

Sign in / Sign up

Export Citation Format

Share Document