Nearly Optimal Algorithms for the Decomposition of Multivariate Rational Functions and the Extended Lüroth's Theorem
Guillaume ChèzePublished in: CoRR (2010)
Keyphrases
- learning algorithm
- worst case
- computational cost
- significant improvement
- dynamic programming
- orders of magnitude
- multiscale
- data structure
- binary search trees
- optimization problems
- computational efficiency
- recently developed
- early stopping
- data sets
- strongly connected components
- greedy heuristic
- decomposition methods
- space complexity
- exhaustive search
- times faster
- theoretical analysis
- data mining techniques
- computational complexity
- decision trees
- decision making