@InProceedings{das_et_al:LIPIcs.CSL.2018.18,
author = {Das, Anupam and Oitavem, Isabel},
title = {{A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions}},
booktitle = {27th EACSL Annual Conference on Computer Science Logic (CSL 2018)},
pages = {18:1--18:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-088-0},
ISSN = {1868-8969},
year = {2018},
volume = {119},
editor = {Ghica, Dan R. and Jung, Achim},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.18},
URN = {urn:nbn:de:0030-drops-96851},
doi = {10.4230/LIPIcs.CSL.2018.18},
annote = {Keywords: Monotone complexity, Positive complexity, Function classes, Function algebras, Recursion-theoretic characterisations, Implicit complexity, Logic}
}