On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials.
James RenegarPublished in: SIAM J. Comput. (1989)
Keyphrases
- worst case
- space complexity
- computational complexity
- learning systems
- upper bound
- intelligent systems
- complexity bounds
- data sets
- running times
- average case
- greedy algorithm
- complex systems
- building blocks
- distributed systems
- mobile devices
- lower bound
- digital libraries
- feature extraction
- database systems
- case study
- e learning
- machine learning