首页 | 本学科首页   官方微博 | 高级检索  
     


On relationships between complexity classes of Turing machines
Authors:V. N. Zakharov  V. A. Kozmidiadi
Affiliation:1.Federal Research Center Computer Science and Control,Russian Academy of Sciences,Moscow,Russia
Abstract: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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号