Elementary analytic functions in $VTC^0$
Emil Je\v{r}\'abek

TL;DR
This paper formalizes the construction and properties of elementary analytic functions within the weak complexity class and its corresponding bounded arithmetic theory, , demonstrating their computability.
Contribution
It provides a formal framework in for elementary analytic functions, extending prior knowledge of their computational properties.
Findings
Elementary analytic functions are formalizable in .
These functions are computable within .
The paper bridges computational complexity and formal arithmetic for these functions.
Abstract
It is known that rational approximations of elementary analytic functions (exp, log, trigonometric, and hyperbolic functions, and their inverse functions) are computable in the weak complexity class . We show how to formalize the construction and basic properties of these functions in the corresponding theory of bounded arithmetic, .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Numerical Methods and Algorithms · Polynomial and algebraic computation
