Lower Bounds on The Complexity of Real-Time Branching Programs.

Klaus Kriegel Stephan Waack

Published in: RAIRO Theor. Informatics Appl. (1988)

Keyphrases

real time
lower bound
worst case
upper bound
low cost
objective function
quality of service
space complexity
average case complexity
decision problems
vc dimension
complexity measures
np hard
high speed
branch and bound