Login / Signup
A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications.
Janos Simon
Mario Szegedy
Published in:
Advances In Computational Complexity Theory (1990)
Keyphrases
</>
lower bound
upper bound
branch and bound algorithm
np hard
branch and bound
objective function
optimal solution
lower and upper bounds
von neumann
worst case
lower bounding
read write
upper and lower bounds
neural network
polynomial approximation
learning algorithm
data sets
sufficiently accurate