Login / Signup
Finding Lower Bounds for Nondeterministic State Complexity Is Hard.
Hermann Gruber
Markus Holzer
Published in:
Developments in Language Theory (2006)
Keyphrases
</>
lower bound
upper bound
worst case
computational complexity
state space
complexity analysis
learning algorithm
decision problems
branch and bound
finite state
upper and lower bounds
lower bounding