Login / Signup
A lower bound for the determinantal complexity of a hypersurface.
Jarod Alper
Tristram Bogart
Mauricio Velasco
Published in:
CoRR (2015)
Keyphrases
</>
lower bound
worst case
upper bound
computational complexity
branch and bound
objective function
branch and bound algorithm
lower and upper bounds
complexity analysis
optimal solution
space complexity
computational cost
online algorithms
sufficiently accurate