An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings.
Andrea Sattler-KleinPublished in: STACS (2007)
Keyphrases
- lower bound
- numerically stable
- upper bound
- branch and bound algorithm
- average case complexity
- polynomial equations
- branch and bound
- np hard
- lower and upper bounds
- objective function
- data structure
- worst case
- optimal solution
- upper and lower bounds
- lower bounding
- numerical stability
- basis functions
- lagrangian relaxation
- prefix tree
- methods in computer vision