A note on ``Category and measure in complexity classes
DOI10.1016/S0020-0190(00)00017-XzbMATH Open1338.68082OpenAlexW2007403908MaRDI QIDQ294730FDOQ294730
Authors: Naoyuki Tokuda, Liang Chen
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001900000017X?np=y
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
Cited In (1)
This page was built for publication: A note on ``Category and measure in complexity classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294730)