pdfformat: 

@InProceedings{nies:LIPIcs:2014:4491, author = {Andr{\'e} Nies}, title = {{Differentiability of polynomial time computable functions}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {602613}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897651}, ISSN = {18688969}, year = {2014}, volume = {25}, editor = {Ernst W. Mayr and Natacha Portier}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4491}, URN = {urn:nbn:de:0030drops44919}, doi = {10.4230/LIPIcs.STACS.2014.602}, annote = {Keywords: Polynomial time randomness, feasible analysis, differentiability, porosity} }
Keywords:  Polynomial time randomness, feasible analysis, differentiability, porosity  
Seminar:  31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)  
Issue date:  2014  
Date of publication:  2014 