scientific article
From MaRDI portal
Publication:4016519
zbMATH Open0767.68040MaRDI QIDQ4016519
Publication date: 16 January 1993
Title of this publication is not available (Why is that?)
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)
Related Items (2)
[[Publication:4218136|Title not available (Why is that?)]] ⋮ The complexity of matrix transposition on one-tape off-line Turing machines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016519)
