Lower bounds for decomposable univariate wild polynomials.
Joachim von zur GathenPublished in: J. Symb. Comput. (2013)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- lower bounding
- optimal solution
- np hard
- objective function
- upper and lower bounds
- markov networks
- worst case
- quadratic assignment problem
- np complete
- randomly generated problems
- multivariate time series
- low order
- neural network
- hermite transform
- multi step
- memory efficient
- pose estimation
- higher order
- linear programming relaxation
- special case
- search space
- decision trees
- lagrange interpolation
- e learning