Bounds for Orders of Derivatives in Differential Elimination Algorithms.
Richard GustavsonAlexey OvchinnikovGleb PogudinPublished in: ISSAC (2016)
Keyphrases
- times faster
- upper and lower bounds
- computationally efficient
- error bounds
- significant improvement
- computational cost
- computationally expensive
- worst case
- optimization problems
- randomized algorithms
- learning algorithm
- computational efficiency
- benchmark datasets
- theoretical analysis
- upper bound
- computational complexity
- data structure
- bayesian networks
- image segmentation