How to recognize zero?
From MaRDI portal
Publication:1382029
DOI10.1006/jsco.1997.0157zbMath0917.11062OpenAlexW2063118073WikidataQ55981126 ScholiaQ55981126MaRDI QIDQ1382029
Publication date: 4 May 1998
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1997.0157
Symbolic computation and algebraic computation (68W30) Decidability (number-theoretic aspects) (11U05) Number-theoretic algorithms; complexity (11Y16) Transcendence theory of other special functions (11J91)
Related Items
On the computation of limsups, A symbolic-numerical algorithm for isolating real roots of certain radical expressions, Bayesian-multiplicative treatment of count zeros in compositional data sets, Positive root isolation for poly-powers by exclusion and differentiation, Meta-expansion of transseries, Guessing singular dependencies, Use of algebraically independent numbers for zero recognition of polynomial terms., Quantifier elimination for a class of exponential polynomial formulas, Complexity bounds for zero-test algorithms, What can we do with a Solution?, Fast evaluation of holonomic functions near and in regular singularities, Recent progress in exact geometric computation, Multiplicative independence of algebraic numbers and expressions, Foundations of Exact Rounding, Weak Wu stratification in \(\mathbb{R}^n\), Fast evaluation of holonomic functions, Real root isolation for exp-log-arctan functions, Elimination of infinitesimal quantifiers, SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE, Counterexamples to the uniformity conjecture, System design of stochastic models using robustness of temporal properties, Computations with effective real numbers
