scientific article
From MaRDI portal
Publication:3497179
zbMath0712.11078MaRDI QIDQ3497179
D. V. Chudnovsky, G. V. Choodnovsky
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
low complexity solution of algorithm equationsmethods and algorithms for computations of solutions of differential equations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Explicit continued fractions and quantum gravity ⋮ On the complexity of integer matrix multiplication ⋮ D-finite numbers ⋮ Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights ⋮ Fast coefficient computation for algebraic power series in positive characteristic ⋮ Guessing singular dependencies ⋮ Relaxed algorithms for \(p\)-adic numbers ⋮ An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli ⋮ Around the numeric-symbolic computation of differential Galois groups ⋮ Efficient accelero-summation of holonomic functions ⋮ A Numerical Transcendental Method in Algebraic Geometry: Computation of Picard Groups and Related Invariants ⋮ On a conjecture of Whittaker concerning uniformization of hyperelliptic curves ⋮ Computing Hypergeometric Functions Rigorously ⋮ Truncation bounds for differentially finite series ⋮ Linear differential equations as a data structure
This page was built for publication:
