Login / Signup
A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs.
Stanislav Zák
Published in:
MFCS (1995)
Keyphrases
</>
lower bound
upper bound
branch and bound algorithm
branch and bound
np hard
objective function
optimal solution
lower bounding
lower and upper bounds
worst case
upper and lower bounds
sufficiently accurate
linear programming relaxation
data sets
concept class
polynomial approximation