A Lower Bound for the Determinantal Complexity of a Hypersurface.
Jarod AlperTristram BogartMauricio VelascoPublished in: Found. Comput. Math. (2017)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- average case complexity
- np hard
- branch and bound
- computational complexity
- objective function
- computational cost
- decision support
- complexity analysis
- scheduling problem
- real time
- theoretical analysis
- decision problems
- information systems
- learning theory
- uniform distribution
- sample complexity
- machine learning
- upper and lower bounds
- lower bounding
- data sets