Differentiability of polynomial time computable functions

DOI10.4230/LIPIcs.STACS.2014.602zbMath1359.03032OpenAlexW2247338103MaRDI QIDQ2965520

André Nies

Publication date: 3 March 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/stacs/stacs2014.html#Nies14

zbMATH Keywords

differentiabilityporositypolynomial time randomnessfeasible analysis

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Related Items (4)

USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS ⋮ Lowness, Randomness, and Computable Analysis ⋮ Algorithmic randomness and Fourier analysis ⋮ Computable Measure Theory and Algorithmic Randomness

This page was built for publication: Differentiability of polynomial time computable functions