arXiv (All)
open access
Description Complexity Bounds for Analytic Approximations of Lipschitz Functions
We study how many bits are needed to write down an elementary analytic expression that uniformly approximates a Lipschitz function. Expressions are finite trees over the basis $\{+,-,\times,÷,\exp\}$ with the variables and rational constants, and their size is $\dc(f)$, the length of the shortest de
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Estimating the number of zeros of Dedekind zeta-functions#1328342
- An Extremal Formula for Elliptical Width and the Bourin--Lee Conjecture#1200028
- A Log-Free $n^{1/5}$ Bound for Chowla's Cosine Problem#972269
- Formally Verified Roundoff Error Bounds on LogSumExp-based Computations#268693
- An $m^{2.943}$ Bohnenblust--Hille Bound on the Boolean Cube#1035112
Record · ID 1325789
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive