Login / Signup
Relativized polynomial time hierarchies having exactly K levels.
Ker-I Ko
Published in:
Computational Complexity Conference (1988)
Keyphrases
</>
levels of abstraction
special case
worst case
data sets
high levels
np hardness
real time
decision making
hierarchical structure
approximation algorithms