Login / Signup
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds.
Karl Bringmann
Allan Grønlund
Marvin Künnemann
Kasper Green Larsen
Published in:
ITCS (2024)
Keyphrases
</>
lower bound
upper bound
branch and bound
neural network
worst case
dynamic environments
branch and bound algorithm
machine learning
database systems
objective function
search space
sample complexity
set of randomly generated instances