Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
This conference talk by Benjamin Hackl from the University of Graz explores computations with asymptotic expansions and explicit error bounds in SageMath. Presented at the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025) at the Fields Institute on May 5, 2025, the 14-minute presentation delves into advanced mathematical techniques for handling asymptotic expansions with precise error quantification using the SageMath computational software. Learn how these mathematical tools can be applied to algorithm analysis with rigorous error bounds.
