Amanote Research

Amanote Research

    RegisterSign In

Bounds for Orders of Derivatives in Differential Elimination Algorithms

doi 10.1145/2930889.2930922
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2016

Authors
Richard GustavsonAlexey OvchinnikovGleb Pogudin
Publisher

ACM Press


Related search

Algorithms for Discovering Bucket Orders From Data

2006English

Bounds for Derivatives in Elliptic Boundary Value Problems

Pacific Journal of Mathematics
Mathematics
1964English

Bounds for Solutions of Ordinary Differential Equations

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1963English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Group Testing Algorithms: Bounds and Simulations

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2014English

Explicit Cost Bounds of Algorithms for Multivariate Tensor Product Problems

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1995English

Best Algorithms for HDR Image Generation. A Study of Performance Bounds

SIAM Journal on Imaging Sciences
MathematicsApplied Mathematics
2014English

New Bounds for Solutions of a Singular Integro-Differential Inequality

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy