No. Title Author Year
1 Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations Nies, André et al. 2018
2 Differentiability of polynomial time computable functions Nies, André 2014
3 The Denjoy alternative for computable functions Bienvenu, Laurent et al. 2012
4 Solovay functions and K-triviality Bienvenu, Laurent et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 4

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI