Login / Signup
The polynomial time hierarchy collapses if the Boolean hierarchy collapses.
Jim Kadin
Published in:
Computational Complexity Conference (1988)
Keyphrases
</>
special case
higher level
lower level
databases
neural network
e learning
high level
worst case
np complete
hierarchical structure
class hierarchy