A polynomial time algorithm for computing all minimal decompositions of a polynomial.
Raoul BlankertzPublished in: ACM Commun. Comput. Algebra (2014)
Keyphrases
- times faster
- dynamic programming
- worst case
- computational complexity
- detection algorithm
- preprocessing
- cost function
- high accuracy
- similarity measure
- linear programming
- recognition algorithm
- convergence rate
- tree structure
- segmentation algorithm
- experimental evaluation
- markov random field
- np hard
- theoretical analysis
- significant improvement
- evolutionary algorithm
- search space
- lower bound
- objective function
- neural network