电邮这篇文章 On relationships between complexity classes of Turing machines
- 作者: Zakharov V.N.1, Kozmidiadi V.A.1
-
隶属关系:
- Federal Research Center Computer Science and Control
- 期: 卷 57, 编号 4 (2017)
- 页面: 726-738
- 栏目: Article
- URL: https://journals.rcsi.science/0965-5425/article/view/179107
- DOI: https://doi.org/10.1134/S096554251704011X
- ID: 179107
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
Classes of time and space complexity of Turing machines are defined, and relationships between them are discussed. New relationships between the defined complexity classes are described.
作者简介
V. Zakharov
Federal Research Center Computer Science and Control
编辑信件的主要联系方式.
Email: VZakharov@ipiran.ru
俄罗斯联邦, Moscow, 119333
V. Kozmidiadi
Federal Research Center Computer Science and Control
Email: VZakharov@ipiran.ru
俄罗斯联邦, Moscow, 119333
补充文件
