An application of the translational method-Reference-Cited by-同舟云学术

An application of the translational method

Published:1994-03 Issue:2 Volume:27 Page:183-186
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Fu Bin,Li Hong -zhou,Zhong Yong

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01195202.pdf

Reference12 articles.

1. E. Allender, R. Beigel, U. Hertrampf, and S. Homer:A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. Lecture Notes in Computer Science, Vol. 415. Springer-Verlag, Berlin, 1990, pp. 1?11.

2. S. Cook: A Hierarchy for Nondeterministic Time Complexity.J. Comput. System Sci.,7 (1973), 354?375.

3. B. Fu, H. Li, and Y. Zhong: Some Properties of Exponential Time Complexity Classes.Proc. 7th IEEE Conference on Structural Complexity Theory, 1992, pp. 50?57.

4. Lecture Notes in Computer Science, Vol. 349;K. Ganesan,1989

5. J. Hartmanis, P. Lewis, and R. Stearns: Hierarchies of Memory Limited Computations.Proc. 6th IEEE Symposium on Switching Circuit Theory and Logical Design, 1965, pp. 179?190.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets;LATIN 2012: Theoretical Informatics;2012

2. The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory;Journal of Computer and System Sciences;2011-01

3. Two oracles that force a big crunch;Computational Complexity;2001-12-01

4. Beyond PNP=NEXP;STACS 95;1995

5. NP with Small Advice;20th Annual IEEE Conference on Computational Complexity (CCC'05)