Login / Signup
Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs.
Matthew Anderson
Michael A. Forbes
Ramprasad Saptharishi
Amir Shpilka
Ben Lee Volk
Published in:
CoRR (2015)
Keyphrases
</>
lower bound
upper bound
branch and bound
objective function
np hard
worst case
test cases
branch and bound algorithm
optimal solution
pruning algorithms
upper and lower bounds
vc dimension
sample complexity
lower and upper bounds
identity management
optimal cost
min sum