Differentiability of polynomial time computable functions
暂无分享,去创建一个
[1] Adam R. Day,et al. Density, forcing, and the covering problem , 2013, 1304.2789.
[2] Kellen Petersen August. Real Analysis , 2009 .
[3] Stephen G. Simpson,et al. Schnorr randomness and the Lebesgue differentiation theorem , 2013 .
[4] Noopur Pathak. A computational aspect of the Lebesgue differentiation theorem , 2009, J. Log. Anal..
[5] André Nies,et al. Randomness and Differentiability , 2011, ArXiv.
[6] Rodney G. Downey,et al. Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.
[7] Michal Morayne,et al. Martingale proof of the existence of Lebesgue points , 1989 .
[8] André Nies,et al. Feasible Analysis, Randomness, and Base Invariance , 2015, Theory of Computing Systems.
[9] André Nies,et al. K-Triviality, Oberwolfach randomness, and differentiability , 2012 .
[10] H. Lebesgue,et al. Sur les intégrales singulières , 1909 .
[11] ComplexityValentine KabanetsDecember. Randomness and Complexity , 1997 .
[12] Yongge Wang,et al. Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness , 1996, STACS.
[13] A. Nies,et al. Series Feasible Analysis , Randomness , and Base Invariance , 2013 .