A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time.
Pierre LairezPublished in: Found. Comput. Math. (2017)
Keyphrases
- high accuracy
- learning algorithm
- cost function
- dynamic programming
- optimization algorithm
- computationally efficient
- randomized approximation
- polynomially bounded
- efficient computation
- improved algorithm
- matching algorithm
- particle swarm optimization
- worst case
- preprocessing
- experimental evaluation
- detection algorithm
- linear programming
- polynomial delay
- search space
- times faster
- np hard
- segmentation algorithm
- theoretical analysis
- clustering method
- standard deviation
- computational cost
- piecewise linear
- probabilistic model
- polynomial size
- computational complexity
- input data
- decision trees