On the worst-case arithmetic complexity of approximating zeros of polynomials.
James RenegarPublished in: J. Complex. (1987)
Keyphrases
- worst case
- upper bound
- average case
- approximation algorithms
- space complexity
- lower bound
- np hard
- error bounds
- greedy algorithm
- computer vision
- data sets
- worst case analysis
- running times
- computational complexity
- neural network
- complexity bounds
- lower complexity
- algebraic geometry
- low order
- sample size
- pose estimation
- higher order
- multiscale
- learning algorithm