Theoretical Computer Science

DOI10.1007/b13810zbMath1257.03089OpenAlexW3144329707MaRDI QIDQ5897362

Ugo Dal Lago

Publication date: 23 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13810

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

The role of polymorphism in the characterisation of complexity by soft types