期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2009
卷号：2009
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We propose a generalization of the traditional algorithmic space and time complexities. Using the concept introduced, we derive an unified proof for the deterministic time and space hierarchy theorems, now stated in a much more general setting. This opens the possibility for the unification and generalization of other results that apply to both the time and space complexities. As an example, we present a similar approach for the gap theorems.
关键词：complexity , complexity measure , GAP , hierarchy
