Login / Signup
Finding Lower Bounds for Nondeterministic State Complexity is Hard.
Hermann Gruber
Markus Holzer
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
lower bound
worst case
upper bound
state space
objective function
e learning
bayesian networks
np hard
computational cost
memory requirements
space complexity
average case complexity