An application of the translational method

DOI10.1007/BF01195202zbMath0794.68056OpenAlexW1965126093MaRDI QIDQ4285626

Yong Zhong, Bin Fu, Hong-zhou Li

Publication date: 17 April 1994

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01195202

zbMATH Keywords

separating complexity classestranslational method

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Turing machine time hierarchy
• Time bounded random access machines
• On relativized exponential and probabilistic complexity classes
• Complete Problems and Strong Polynomial Reducibilities
• Separating Nondeterministic Time Complexity Classes
• On the Computational Complexity of Algorithms
• Two-Tape Simulation of Multitape Turing Machines

This page was built for publication: An application of the translational method