Advertisement

The Flow of Data and the Complexity of Algorithms

  • Lars Kristiansen
  • Neil D. Jones
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3526)

Abstract

Let C be a program written in a formal language in order to be executed by some kind of machinery. A statement about C might be true or false and has the form C:M. For the time being, just consider the statement C:M as a collection of data yielding information about the resources required to execute C; and if we know that C:M is true (or false), we know something useful when it comes to determine the computational complexity of C. Let Γ be a set of statements, and let Γ⊧C:M denote that C:M will be true if all the statements in Γ are true. (The statements in Γ might say something about the computational complexity of the subprograms of C.) If Γ = 0, we will simply write⊧C:M.

Keywords

Computational Complexity Vector Versus Target Variable Derivation Rule Nondeterministic Choice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Hopcroft, J.E., Jeffrey, D.: The design and analysis of computer algorithms. Addison-Wesley Publishing Co., Reading (1975)Google Scholar
  2. 2.
    Bellantoni, S.J., Cook, S.: A New Recursion-Theoretic Characterization of the Polytime Functions. Computational Complexity 2, 97–110 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Caseiro, V.H.: Equations for Defining Poly-time Functions. Ph.D. thesis, Dept. of informatics, Faculty of Mathematics and Natural Sciences University of Oslo (February 1997)Google Scholar
  4. 4.
    Frederiksen, C.C.: Automatic runtime analysis for first order functional programs. Master Thesis, Dep. of Computer Science, University of Copenhagen (2002)Google Scholar
  5. 5.
    Jones, N.D.: The expressive power of higher-order types or, life without CONS. J. Functional Programming 11, 55–94 (2001)zbMATHCrossRefGoogle Scholar
  6. 6.
    Jones, N.D.: LOGSPACE and PTIME characterized by programming languages. Theoretical Computer Science 228, 151–174 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Jones, N.D., Bohr, N.: Termination analysis of the untyped lambda-calculus. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 1–23. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity 14, 72–88 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kristiansen, L., Niggl, K.-H.: On the computational complexity of imperative programming languages. Theoretical Computer Science 318, 139–161 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Kristiansen, L., Niggl, K.-H.: The Garland Measure and Computational Complexity of Stack Programs. Electronic Notes in Theoretical Computer Science, vol. 90. Elsevier, Amsterdam (2003)Google Scholar
  11. 11.
    Kristiansen, L., Voda, P.J.: Complexity classes and fragments of C. Information Processing Letters 88, 213–218 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Kristiansen, L., Voda, P.J.: Programming languages capturing complexity classes (submitted)Google Scholar
  13. 13.
    Lee, C.S., Jones, N., Ben-Amram, A.M.: The size-change principle for program termination. ACM Principles of Programming Languages, pp. 81–92. ACM Press, New York (2001)Google Scholar
  14. 14.
    Leivant, D.: Intrinsic theories and computational complexity. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 177–194. Springer, Heidelberg (1995)Google Scholar
  15. 15.
    Niggl, K.-H.: Control Structures in Programs and Computational Complexity. Annals of Pure and Applied Logic 133, 247–273 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Simmons, H.: The realm of primitive recursion. Arch. Math. Logic 27, 177–188 (1988)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Lars Kristiansen
    • 1
    • 2
  • Neil D. Jones
    • 3
  1. 1.Faculty of EngineeringOslo University CollegeOsloNorway
  2. 2.Department of MathematicsUniversity of OsloOlsoNorway
  3. 3.Department of Computer ScienceUniversity of CopenhagenCopenhagenDenmark

Personalised recommendations