Zero tests for constants in simple scientific computation

DOI10.1007/s11786-007-0002-xzbMath1145.26001OpenAlexW2000273630MaRDI QIDQ2465574

Daniel Richardson

Publication date: 4 January 2008

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-007-0002-x

zbMATH Keywords

Schanuel conjecturezero testexp-log constants

Mathematics Subject Classification ID

Algebraic independence; Gel'fond's method (11J85) Complexity of computation (including implicit computational complexity) (03D15) Elementary functions (26A09)

Related Items (6)

Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation ⋮ Meta-expansion of transseries ⋮ EFFECTIVE ASYMPTOTICS ANALYSIS FOR FINANCE ⋮ Guessing singular dependencies ⋮ In Praise of Numerical Computation ⋮ Model checking single agent behaviours by fluid approximation

This page was built for publication: Zero tests for constants in simple scientific computation