A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time.
Pierre LairezPublished in: CoRR (2015)
Keyphrases
- computational cost
- optimal solution
- improved algorithm
- dynamic programming
- preprocessing
- experimental evaluation
- high accuracy
- learning algorithm
- computational complexity
- optimization algorithm
- polynomial size
- linear systems
- exact solution
- times faster
- theoretical analysis
- probabilistic model
- cost function
- lower bound
- objective function
- worst case
- np hard
- clustering method
- matching algorithm
- k means
- standard deviation
- recognition algorithm
- efficient computation
- data structure
- genetic algorithm