PP is as Hard as the Polynomial-Time Hierarchy.

Published in: SIAM J. Comput. (1991)

Keyphrases

computational complexity
hierarchical structure
special case
lower level
real time
real world
information systems
optimal solution
upper bound
higher level
optimal planning
computationally hard