Skip to main content

Advertisement

Springer Nature Link
Log in

An application of the translational method

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We separateNE from\(P_{n^{o(1)} - T} (NP)\) by using the translational method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

    Google Scholar 

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

    Google Scholar 

  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. K. Ganesan and S. Homer: Complete Problems and Strong Polynomial Reducibilities. InTheoretical Aspects of Computer Science. Lecture Notes in Computer Science, Vol. 349. Springer-Verlag, Berlin, 1989, pp. 240–250.

    Google Scholar 

  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.

  6. J. Hartmanis and R. Stearns: On the Computational Complexity of Algorithms.Trans. Amer. Math. Soc.,117 (1965), 285–306.

    Google Scholar 

  7. H. Heller: On Relativized Exponential and Probabilistic Complexity Classes.Inform. and Control,71 (1986), 213–243.

    Google Scholar 

  8. F. Hennie and R. Stearns: Two-Tape Simulation of Multitape Turing Machine.J. Assoc. Comput. Mach.,13 (1966), 533–546.

    Google Scholar 

  9. S. Homer: Structural Properties of Nondeterministic Complete Sets.Proc. 5th IEEE Conference on Structural Complexity Theory, 1990, pp. 3–10.

  10. S. Ruby and P. Fischer: Translational Methods and Computational Complexity.Proc. 6th IEEE Symposium on Switching Circuit Theory and Logical Design, 1965, pp. 173–178.

  11. J. Seiferas, M. Fisher, and A. Meyer: Separating Nondeterministic Time Complexity Classes.J. Assoc. Comput. Mach.,25 (1978), 146–167.

    Google Scholar 

  12. S. Zak: A Turing Machine Hierarchy.Theoret. Comput. Sci.,26 (1983), 327–333.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Beijing Computer Institute, 100044, Beijing, People's Republic of China

    Bin Fu

  2. Beijing Laboratory of Cognitive Science, The University of Science and Technology of China, 100039, Beijing, People's Republic of China

    Bin Fu

  3. Department of Mathematics, Yunnan Education College, 650031, Kunming, People's Republic of China

    Hong -zhou Li

  4. Automation Research Institute, Ministry of Metallurgical Industry, 100071, Beijing, People's Republic of China

    Yong Zhong

Authors
  1. Bin Fu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Hong -zhou Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Yong Zhong
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This research was supported in part by HTP863. A preliminary version of this work appeared as [FLZ]. The research of Hong-zhou Li was performed while he was visiting the Beijing Computer Institute.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, B., Li, H.z. & Zhong, Y. An application of the translational method. Math. Systems Theory 27, 183–186 (1994). https://doi.org/10.1007/BF01195202

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01195202

Keywords