Complexity bounds for zero-test algorithms

DOI10.1016/j.jsc.2006.06.001zbMath1124.68045OpenAlexW2146555940MaRDI QIDQ2457383

Joris van der Hoeven, John R. Shackell

Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2006.06.001

zbMATH Keywords

complexitypower seriesPfaffian serieswitness conjectureZero-test

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items

Effective approximation of the solutions of algebraic equations, Decision problem for a class of univariate Pfaffian functions, Meta-expansion of transseries, Effective analytic functions, Counterexamples to witness conjectures, Computing with D-algebraic power series, On ramification indices of formal solutions of constructive linear ordinary differential systems, On asymptotic extrapolation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to recognize zero?
• Relax, but don't be too lazy
• Symbolic asymptotics
• Effective Nullstellensatz for arbitrary ideals
• On Schanuel's conjectures
• Zero-Equivalence in Function Fields Defined by Algebraic Differential Equations
• A note on algebraic independence of logarithmic and exponential constants
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Transcendental numbers and diophantine approximations
• Fast evaluation of holonomic functions near and in regular singularities