Advertisement

On the effectiveness of some operations on algorithms

  • Wojciech Kowalczyk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. Hartmanis, J. /1983/, On Gödel speed-up and succinctness of language representations", Theor. Comput. Sci., 26, 335–342.Google Scholar
  3. 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.Google Scholar
  4. Rogers, H. /1967/, Theory of recursive functions and effective computability, McGraw-Hill, New York.Google Scholar
  5. Schöning, U. /1982/, A uniform approach to obtain diagonal sets in complexity classes, Theoret. Comput. Sci., 18, 95–103.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Wojciech Kowalczyk
    • 1
  1. 1.Institute of MathematicsUniversity of Warsaw PKiN LXp.WarsawPoland

Personalised recommendations