Representations and evaluation strategies for feasibly approximable functions

DOI10.3233/COM-180234zbMath1493.03006arXiv1710.03702MaRDI QIDQ4995603

Eike Neumann, Michal Konečný

Publication date: 25 June 2021

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.03702

zbMATH Keywords

computational complexity; polynomial approximation; real functions; computable analysis

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03D78: Computation over the reals, computable analysis

Uses Software

• Haskell