The Flow of Data and the Complexity of Algorithms
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.
KeywordsComputational Complexity Vector Versus Target Variable Derivation Rule Nondeterministic Choice
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., Hopcroft, J.E., Jeffrey, D.: The design and analysis of computer algorithms. Addison-Wesley Publishing Co., Reading (1975)Google Scholar
- 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.Frederiksen, C.C.: Automatic runtime analysis for first order functional programs. Master Thesis, Dep. of Computer Science, University of Copenhagen (2002)Google Scholar
- 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
- 12.Kristiansen, L., Voda, P.J.: Programming languages capturing complexity classes (submitted)Google Scholar
- 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.Leivant, D.: Intrinsic theories and computational complexity. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 177–194. Springer, Heidelberg (1995)Google Scholar