Guest editorial
From MaRDI portal
Publication:5892167
DOI10.1145/1555746.1555747zbMath1351.00038OpenAlexW2090097007MaRDI QIDQ5892167
No author found.
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
Analysis of algorithms and problem complexity (68Q25) Proceedings of conferences of miscellaneous specific interest (00B25) Complexity of computation (including implicit computational complexity) (03D15) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)
Related Items (3)
Reverse complexity ⋮ Computational Complexity Via Finite Types ⋮ A new order-theoretic characterisation of the polytime computable functions
This page was built for publication: Guest editorial
