This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chew, P. and Machtey, M. /1981/, A note on structure and looking back applied to the relative complexity of computable functions, J. Comput. System Sci. 22, 53–59.
Hartmanis, J. /1983/, On Gödel speed-up and succinctness of language representations", Theor. Comput. Sci., 26, 335–342.
Landweber, L., Lipton, R. and Robertson, E. /1981/ On the structure of sets in NP and other complexity classes, Theoret. Comput. Sci., 15, 181–200.
Rogers, H. /1967/, Theory of recursive functions and effective computability, McGraw-Hill, New York.
Schöning, U. /1982/, A uniform approach to obtain diagonal sets in complexity classes, Theoret. Comput. Sci., 18, 95–103.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kowalczyk, W. (1985). On the effectiveness of some operations on algorithms. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_13
Download citation
DOI: https://doi.org/10.1007/3-540-16066-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16066-3
Online ISBN: 978-3-540-39748-9
eBook Packages: Springer Book Archive