Differentiability of polynomial time computable functions
From MaRDI portal
Publication:2965520
DOI10.4230/LIPICS.STACS.2014.602zbMATH Open1359.03032OpenAlexW2247338103MaRDI QIDQ2965520FDOQ2965520
Authors: André Nies
Publication date: 3 March 2017
Full work available at URL: https://dblp.uni-trier.de/db/conf/stacs/stacs2014.html#Nies14
Recommendations
- scientific article; zbMATH DE number 4134023
- Pointwise complexity of the derivative of a computable function
- Derivatives of Computable Functions
- Characterizing polynomial time computability of rational and real functions
- scientific article; zbMATH DE number 1303206
- Functions computable in polynomial space
- Computability with polynomial differential equations
- scientific article; zbMATH DE number 4145899
- scientific article; zbMATH DE number 3932433
- scientific article; zbMATH DE number 3996316
Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78) Constructive and recursive analysis (03F60)
Cited In (16)
- Algorithmic randomness and Fourier analysis
- The Denjoy alternative for computable functions
- Pointwise complexity of the derivative of a computable function
- Randomness and differentiability of convex functions
- Effective genericity and differentiability
- Title not available (Why is that?)
- Computable Measure Theory and Algorithmic Randomness
- Lowness, Randomness, and Computable Analysis
- Online computability and differentiation in the Cantor space
- A Note on The Functions Which Are Not Polynomial Time Computable From Their Graphs
- Using almost-everywhere theorems from analysis to study randomness
- Algorithmic aspects of Lipschitz functions
- Randomness and differentiability
- Denjoy, Demuth and density
- Polynomial differential equations compute all real computable functions on computable compact intervals
- On the tabulation complexity of infinitely differentiable functions and functions specified by the Hölder condition on their derivatives
This page was built for publication: Differentiability of polynomial time computable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965520)