Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm.
Russell ImpagliazzoPavel PudlákJirí SgallPublished in: Comput. Complex. (1999)
Keyphrases
- worst case
- detection algorithm
- numerically stable
- preprocessing
- k means
- objective function
- computational complexity
- lower bound
- times faster
- np hard
- dynamic programming
- upper bound
- theoretical analysis
- probabilistic model
- algebraic equations
- running times
- expectation maximization
- search space
- optimal solution
- simulated annealing
- learning algorithm
- combinatorial optimization
- similarity measure
- image processing