![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 585
Volume 585, June 2015
- Ugo Dal Lago
, Guillaume Bonfante:
Developments in Implicit Complexity (DICE 2012). 1-2
- Martin Avanzini, Naohi Eguchi, Georg Moser:
A new order-theoretic characterisation of the polytime computable functions. 3-24 - Guillaume Bonfante, Florian L. Deloup, Antoine Henrot:
Real or natural number interpretation and their effect on complexity. 25-40 - Hugo Férée
, Emmanuel Hainry
, Mathieu Hoyrup, Romain Péchoux
:
Characterizing polynomial time complexity of stream programs using interpretations. 41-54 - Aloïs Brunel, Marco Gaboardi:
Realizability models for a linear dependent PCF. 55-70 - Yuxin Deng
, Yu Zhang:
Program equivalence in linear contexts. 71-90 - Elvira Albert, Jesús Correas Fernández
, Germán Puebla, Guillermo Román-Díez
:
A multi-domain incremental analysis engine and its application to incremental resource analysis. 91-114 - Sebastian Eberhard:
Applicative theories for logarithmic complexity classes. 115-135
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.