Guest editorial: Special issue on implicit computational complexity

DOI10.1145/1555746.1555747MaRDI QIDQ5892167zbMATH OpenOpenAlexFDO

Authors

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1555746.1555747

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Developments in implicit complexity (DICE 2012)
• Developments in implicit computational complexity
• Special issue: Developments in implicit computational complexity, 2014 and 2015
• Preface
• LICS 2003 special issue

Cited in

(13)

• Special issue: Developments in implicit computational complexity, 2014 and 2015
• Guest editorial: Special issue on theoretical informatics
• Special issue: Implicit computational complexity. Selected papers based on the presentation at the workshop, Santa Barbara, CA, USA, June 29--30, 2000.
• Developments in implicit computational complexity
• Developments in implicit complexity (DICE 2012)
• A new order-theoretic characterisation of the polytime computable functions
• Reverse complexity
• Computational Complexity Via Finite Types
• A Short Introduction to Implicit Computational Complexity
• Special issue ``Conference on computational complexity 2013 -- guest editor's foreword
• LICS 2001 special issue
• Guest editorial: Special issue on parameterized and exact computation
• Special issue on logic and complexity

This page was built for publication: Guest editorial: Special issue on implicit computational complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892167)