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


For completeness, sublogarithmic space is no space
Authors:Manindra Agrawal
Affiliation:Department of Computer Science, Indian Institute of Technology, Kanpur 208016, India
Abstract:It is shown that for any class C closed under linear-time reductions, the complete sets for C under sublogarithmic reductions are also complete under 2DFA reductions, and thus are isomorphic under first-order reductions.
Keywords:Isomorphisms   Completeness   Sublogarithmic reductions   Computational complexity
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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